#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#define pii pair<int,int>
#define mp make_pair
using namespace std;
const int N=105,M=1005;
int ver[N],to[M],nxt[M],val[M],idx,n,dis[N],mk[N],m,s;
priority_queue<pii>q;
void add(int x,int y,int z){
    to[++idx]=y,nxt[idx]=ver[x],ver[x]=idx,val[idx]=z;
}
int main(){
    freopen("path.in","r",stdin);
    freopen("path.out","w",stdout);
    scanf("%d %d %d",&n,&m,&s);
    for(int i=1;i<=m;i++){
        int u,v,w;
        scanf("%d %d %d",&u,&v,&w);
        add(u,v,w),add(v,u,w);
    }
    memset(dis,0x3f,sizeof(dis));
    dis[s]=0,q.push(mp(0,s));
    while(q.size()){
        int x=q.top().second;q.pop();
        if(mk[x])continue;
        mk[x]=1;
        for(int i=ver[x];i;i=nxt[i]){
            int y=to[i];
            if(dis[y]>dis[x]+val[i]){
                dis[y]=dis[x]+val[i];
                q.push(mp(-dis[y],y));
            }
        }
    } 
    for(int i=1;i<=n;i++){
        printf("%d ",dis[i]);
    }
    return 0;
}