#include <cstdio>
#include <vector>
using namespace std;
vector<pair<int, long long> > G[500010];
int col[500010], vis[500010], flag;
int n, m, s, u, v, fa[500010], deg[500010];
long long w;
int find(int x) {
    if (fa[x] == x) return x;
    return fa[x] = find(fa[x]);
}
void merge(int x, int y) {
    fa[find(x)] = find(y);
}
void dfs(int u) {
    vis[u] = true;
    for (pair<int, long long> e : G[u]) {
        int v = e.first;
        if (!vis[v]) {
            col[v] = col[u] ^ 1;
            dfs(v);
        } else if (col[v] == col[u]) {
            flag = true;
        }
        if (flag) return;
    }
}
long double a;
int main() {
    scanf("%d%d%d", &n, &m, &s);
    for (int i = 1; i <= n; i++) {
        fa[i] = i;
    }
    for (int i = 1; i <= m; i++) {
        scanf("%d%d%lld", &u, &v, &w);
        G[u].push_back({v, w});
        G[v].push_back({u, w});
        merge(u, v);
    }
    dfs(s);
    if (flag) {
        long long sum = 0;
        for (int i = 1; i <= n; i++) {
            if (find(i) == find(s)) {
                for (pair<int, long long> e : G[i]) {
                    if (find(e.first) == find(s)) {
                        sum += e.second;
                        deg[i] += e.second;
                    }
                }
            }
        }
        for (int i = 1; i <= n; i++) {
            printf("%.18Lf ", deg[i] / (long double)sum);
        }
    } else {
        long long sum = 0;
        for (int i = 1; i <= n; i++) {
            if (find(i) == find(s) && col[i] == col[s]) {
                for (pair<int, long long> e : G[i]) {
                    if (find(e.first) == find(s)) {
                        sum += e.second;
                        deg[i] += e.second;
                    }
                }
            }
        }
        for (int i = 1; i <= n; i++) {
            printf("%.18Lf ", deg[i] / (long double)sum);
        }
    }
    return 0;
}