//
//  na 2437.cpp
//  Competitive Programming
//
//  Created by m2 on 2024/11/27.
//

#include <stdio.h>
#include <iostream>
#include <time.h>
#include <random>
using namespace std;
const int maxn = 5e5 + 5;
int n, m, s, ul[maxn], vl[maxn], wl[maxn];
bool vis[maxn], col[maxn];
double wsum[maxn], plist1[maxn], plist2[maxn];
double *lp = plist1, *np = plist2;
struct Edge{
    int i, w; Edge *nxt;
    Edge(int i, int w, Edge *nxt): i(i), w(w), nxt(nxt) {}
};
Edge *head[maxn];
inline void edge(int st, int en, int w){ head[st] = new Edge(en, w, head[st]); }
#define trav(x) for(Edge *e = head[x]; e != nullptr; e = e->nxt)
template<typename T> inline void rd(T &v){
    v = 0; char r = getchar();
    while(r - 48 >= 10u)
        r = getchar();
    while(r - 48 < 10u){
        v = (v << 3) + (v << 1) + (r ^ 48);
        r = getchar();
    }
}
inline void sim(){
    swap(lp, np);
    for(int i = 1; i <= n; ++i)
        np[i] = 0;
    for(int i = 1; i <= n; ++i)
        trav(i)
            np[e->i] += lp[i] * (e->w / wsum[i]);
}
bool bi = true;
void dfs(int idx, bool nc){
    if(vis[idx]){
        if(col[idx] != nc)
            bi = false;
        return;
    }
    vis[idx] = true;
    col[idx] = nc;
    trav(idx) dfs(e->i, !nc);
}
inline void norm(){
    double ps = 0;
    for(int i = 1; i <= n; ++i)
        ps += np[i];
    for(int i = 1; i <= n; ++i)
        np[i] /= ps;
}
int main(){
    clock_t st = clock();
    cin.tie(0)->sync_with_stdio(false);
    rd(n); rd(m); rd(s);
    for(int i = 0; i < m; ++i){
        rd(ul[i]); rd(vl[i]); rd(wl[i]);
        edge(ul[i], vl[i], wl[i]);
        edge(vl[i], ul[i], wl[i]);
        wsum[ul[i]] += wl[i];
        wsum[vl[i]] += wl[i];
    }
    dfs(s, true);
//    np[s] = 1;
//    random_device rd;
//    mt19937 rnd(rd());
//    uniform_real_distribution<> dis(0.0, 1.0);
//    for(int i = 1; i <= n; ++i)
//        if(vis[i])
//            np[i] = dis(rnd);
    for(int i = 1; i <= n; ++i)
        if(vis[i])
            np[i] = wsum[i];
    norm();
//    for(int i = 1; i <= n; ++i)
//        cerr << np[i] << ' ';
//    cerr << endl;
//    bool f = false;
//    while(double(clock() - st) / CLOCKS_PER_SEC < 0.7 || f){
//        sim();
//        f = !f;
//    }
//    cerr << "BIPART? " << bi << endl;
    if(bi){
        double ps = 0;
        for(int i = 1; i <= n; ++i)
            if(col[i])
                ps += np[i];
        for(int i = 1; i <= n; ++i)
            if(col[i])
                printf("%.10f ", np[i] / ps);
            else
                printf("0 ");
    }else{
        for(int i = 1; i <= n; ++i)
            printf("%.10f ", np[i]);
    }
    printf("\n");
    return 0;
}