#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <utility>
#include <cstring>
using namespace std;
int n,m;
const int N=100015,INF=1e9;
int w[N],h[N],e[N],ne[N],cnt,k;
int d[N];
bool t[N];
void add_in(int a,int b,int c){
    cnt++;e[cnt]=b; w[cnt]=c; ne[cnt]=h[a]; h[a]=cnt;
}
void djss(){
    for(int i=1;i<=n;i++)
        d[i]=INF;
    d[k]=0;
    priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > dub;
    dub.push({0,k});
    while(dub.size()){
        pair<int,int> temp=dub.top();
        dub.pop();
        int ff=temp.first,ss=temp.second;
        if(t[ss]) continue;
        t[ss]=true;
            for(int i=h[ss];i;i=ne[i]){
                int j=e[i];
                if(d[j]>d[ss]+w[i]){
                    d[j]=d[ss]+w[i];
                    dub.push({d[j],j});
                }
            }
        
    }
    for(int i=1;i<=n;i++)
        cout<<d[i]<<" ";
}
int main(){
    cin>>n>>m>>k;
    memset(h,-1,sizeof(h));
    for(int i=1;i<=m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        add_in(a,b,c);
    }
    djss();
    return 0;
}