#include <iostream>
#include <fstream>
#define NMAX 50050
#define INF 100000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int c[NMAX/5][NMAX/5],USE[NMAX],d[NMAX],t[NMAX];
int n,s;
void citire(){int i,j,x,y,cost;
    fin>>n>>s;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            if(j==i) c[i][j]=0;
            else c[i][j]=INF;
    while (fin>>x>>y>>cost)c[x][y]=cost;
}
void dijkstra(int s){int i,minn,k,j,x;
    for(i=1;i<=n;i++) d[i]=INF;
    d[s]=0;
    for (k=1;k<=n;k++){
        minn=INF;
        for(i=1;i<=n;i++)
        if(!USE[i]&&d[i]<minn){
            minn=d[i];
            x=i;
        }
        if(minn==INF) break;
        USE[x]=1;
        for(i=1;i<=n;i++)
            if(d[x]+c[x][i]<d[i]){
                d[i]=d[x]+c[x][i];
                t[i]=x;
            }
    }
}
int main()
{
    citire();
    dijkstra(1);
    for(int i=2;i<=n;i++){
        if(d[i]==INF) fout<<0<<" ";
        else fout<<d[i]<<" ";
    }
    return 0;
}