#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;

const int N = 1000010;
int n,m,s;

int h[N],e[N],w[N],ne[N],idx;

int dist[N];

bool st[N];

typedef pair<int,int> PII;

void add(int a,int b,int c){
    e[idx]=b,w[idx]=c,ne[idx]=h[a],h[a]=idx++;
}

void dijkstra(int s){
    priority_queue<PII, vector<PII>, greater<PII>> heap;
    memset(dist,0x3f,sizeof dist);
    dist[s]=0;
    heap.push({0,s});
    while(!heap.empty()){
        auto t=heap.top();
        heap.pop();
        int x=t.first,y=t.second;
        if(st[y]==true)continue;
        st[y]=true;
        for(int i=h[y];i!=-1;i=ne[i]){
            int j=e[i];
             if(dist[j]>dist[y]+w[i]){
                 dist[j]=dist[y]+w[i];
                 heap.push({dist[j],j});
             }
        	}
        }
        for(int i=1;i<=n;i++){
            if(dist[i]==0x3f3f3f3f) cout<<2e31 - 1<<" ";
            else cout<<dist[i]<<" ";
    }
}

int main(){
    memset(h,-1,sizeof h);
    cin>>n>>m>>s;
    for(int i=0;i<m;i++){
        int u,v,k;
        cin>>u>>v>>k;
        add(u,v,k);
    }
    dijkstra(s);
}