#include <bits/stdc++.h>
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int NMAX=100005;
const int INF=2000000000;

int n, m, x, y, c, s;

vector <pair <int, int>> a[NMAX];
priority_queue <pair <int,int>> heap;
vector <int> dist(NMAX, INF);
bitset <NMAX> viz;

int main(){
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++){
        fin>>x>>y>>c;
        a[x].push_back({y, c});
    }

    dist[s]=0;
    heap.push({0,s});

    while(!heap.empty()){
        int inter=heap.top().second;
        int d=-heap.top().first;

        heap.pop();

        if(!viz[inter]){
            for(pair<int,int> urm : a[inter]){
                if(dist[urm.first]>dist[inter]+urm.second){
                    dist[urm.first]=dist[inter]+urm.second;
                    heap.push({-dist[urm.first],urm.first});
                }
            }
            viz[inter]=1;
        }
    }

    for(int i=1;i<=n;i++){
        if(dist[i]!=INF)
            fout<<dist[i]<<' ';
        else
            fout<<"0"<<' ';
    }
    return 0;
}