#include<fstream>
#include<vector>
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
const int Nmax=50005,inf=2000000000;
vector <pair<int,int>> g[Nmax];
int n,p,viz[Nmax],D[Nmax];

void read()
{int x,y,z;
    fin>>n>>p;

    while(fin>>x>>y>>z)
    {
        g[x].push_back(make_pair(y,z));
    }
}
void print()
{
    for(int i=2;i<=n;i++)
        if(D[i]!=inf)
        fout<<D[i]<<" ";
    else
        fout<<"0"<<" ";
    fout<<"\n";
}
void dickstra(int p)
{
    for(int i=1;i<=n;i++)
        if(i!=p)
        D[i]=inf;

    for(int k=0;k<n;k++)
    {
        int Min=inf,nod;

        for(int i=1;i<=n;i++)
        {
            if(!viz[i] && D[i]<Min)
            {
                Min=D[i];
                nod=i;
            }
        }
    viz[nod]=1;

    for(int i=0;i<g[nod].size();i++)
    {
        int vecin=g[nod][i].first,cost=g[nod][i].second;
        D[vecin]=min(D[vecin],D[nod]+cost);

    }


    }
}
int main()
{
read();
dickstra(1);
print();






fin.close();
fout.close();
return 0;
}