#include <fstream>
#define inf 2000000
using namespace std;
ifstream f ("dijkstra.in");
ofstream g ("dijkstra.out");
int v[250001][4],d[50001],n,k,ok=1,i,j,c,m;
int main()
{
    f>>n>>m;
    int nr=1;
    for(i=1;i<=n;++i) d[i]=inf; //initializam cu valori imense
    d[1]=0; //de la 1 la 1 e dist 0
    for(i=1;i<=m;++i)
    {
        f>>v[i][1]>>v[i][2]>>v[i][3];
        if(v[i][1]==1) d[v[i][2]]=v[i][3]; //daca duce direct inspre primul nod
    }
    while(ok&&nr<n)
    {
        ok=0; //vom aplica pana cand nu vom mai putea imbunatati drumurile
        for(k=1;k<=m;++k)
        {
            i=v[k][1];
            j=v[k][2];
            c=v[k][3];
            if(d[j]>d[i]+c) {d[j]=d[i]+c;ok=1;}
        }
        ++nr;
    }
    for(i=2;i<=n;++i)
    {
        if(d[i]<inf) g<<d[i]<<' ';
        else g<<0<<' ';
    }
    return 0;
}