#include <bits/stdc++.h>

using namespace std;

const int BUFFER_SIZE = 1 << 20;
char rb[BUFFER_SIZE], *rp = rb, *rt = rb;
inline char read_char() {
    return rp == rt ? (rt = rb + fread(rb, 1, BUFFER_SIZE, stdin), rp = rb, *rp ++) : *rp ++;
}
inline int read_int() {
    int x = 0;
    char ch = read_char(), flag = 0;
    while (ch != '-' && (ch < '0' || ch > '9')) {
        ch = read_char();
    }
    if (ch == '-') {
        flag = 1;
        ch = read_char();
    }
    for (x = 0; ch >= '0' && ch <= '9'; ch = read_char()) {
        x = x * 10 + (ch - '0');
    }
    return flag ? -x : x;
}

const int MAX_N = 500000 + 5;
typedef long long i64;

int N, M;
int fath[MAX_N], dis[MAX_N], odd[MAX_N];
i64 SUM, sum[MAX_N];
double ans[MAX_N];

int get_fath(int i) {
    if (fath[i] != i) {
        int f = get_fath(fath[i]);
        dis[i] ^= dis[fath[i]];
        fath[i] = f;
    }
    return fath[i];
}

int main() {
    N = read_int(), M = read_int();
    int s = read_int();
    for (int i = 1; i <= N; i ++) {
        fath[i] = i, dis[i] = 0;
    }
    for (int i = 1; i <= M; i ++) {
        int x = read_int(), y = read_int(), w = read_int();
        sum[x] += w;
        sum[y] += w;
        int fx = get_fath(x), fy = get_fath(y);
        if (fx != fy) {
            fath[fx] = fy;
            dis[fx] = dis[x] ^ dis[y] ^ 1;
            odd[fy] |= odd[fx];
        } else {
            odd[fx] |= dis[x] ^ dis[y] ^ 1;
        }
    }
    int fs = get_fath(s);
    for (int i = 1; i <= N; i ++) {
        if (get_fath(i) == fs) {
            SUM += sum[i];
        }
    }
    if (odd[fs]) {
        double t = 1.0 / SUM;
        for (int i = 1; i <= N; i ++) {
            if (get_fath(i) == fs) {
                ans[i] = sum[i] * t;
            }
        }
    } else {
        double t = 2.0 / SUM;
        for (int i = 1; i <= N; i ++) {
            if (get_fath(i) == fs && dis[i] == dis[s]) {
                ans[i] = sum[i] * t;
            }

        }
    }
    for (int i = 1; i <= N; i ++) {
        printf("%.10lf%c", ans[i], i < N ? ' ' : '\n');
    }
    return 0;
}