#include <fstream>
#include <vector>
#define Nmax 50005
#define oo 2000000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int D[Nmax],S[Nmax],N,M;
vector <pair<int,int> > G[Nmax];

void Read()
{
    fin>>N>>M;
    while(M--)
    {
        int X,Y,C;
        fin>>X>>Y>>C;
        pair<int,int>P;
        P.first=Y;
        P.second=C;
        G[X].push_back(P);
    }
}

void Dijkstra()
{
    for(int i=1;i<=N;++i)
        D[i]=oo;
    D[1]=0;
    for(int k=1;k<=N;++k)
    {
        int Min=oo,Nod;
        for(int i=1;i<=N;++i)
            if(D[i]<Min && !S[i])
        {
            Min=D[i];
            Nod=i;
        }
        S[Nod]=1;

        for(int i=0;i<(int)G[Nod].size();++i)
        {
            int Vecin=G[Nod][i].first;
            int Cost=G[Nod][i].second;
            if(!S[Vecin])
                D[Vecin]=min(D[Vecin],D[Nod]+Cost);
        }
    }
}

void Print()
{
    for(int i=2;i<=N;i++)
        if(D[i]==oo) fout<<"0 ";
    else fout<<D[i]<<" ";
    fout<<"\n";
}

int main()
{
    Read(); Dijkstra(); Print();
    return 0;
}