#include <bits/stdc++.h>
#define inf 2000000
#define BUF_SIZE 4096
using namespace std;
char buf[BUF_SIZE];
int poz=BUF_SIZE;
inline char GetChar(){
    if(poz==BUF_SIZE){
        fread(buf,1,BUF_SIZE,stdin);
        poz=0;
    }
    return buf[poz++];
}
inline int GetInt(){
    int x=0;char c;
    do{
        c=GetChar();
    }while(!isdigit(c));
    do{
        x=x*10+c-'0';
        c=GetChar();
    }while(isdigit(c));
    return x;
}
int v[250001][4],d[50001],n,k,ok=1,i,j,c,m;
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    n=GetInt();
    m=GetInt();
    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)
    {
        v[i][1]=GetInt();
        v[i][2]=GetInt();
        v[i][3]=GetInt();
        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) printf("%d ",d[i]);
        else printf("0 ");
    }
    return 0;
}