#include <fstream>

using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
int n,v[50000],d[50000],t[50000],mat[20000][20000];
void parc(int ns)
{   int i,j,nod,ok,mini;
    for(i=1;i<=n;i++)
    {   d[i]=mat[ns][i];
        t[i]=ns;



    }
    v[ns]=1;
    ok=0;
    while(ok==0)
    {   mini=1000000;
        for(i=1;i<=n;i++)
           if(v[i]==0)if(d[i]<mini)
        {   mini=d[i];
            nod=i;

        }



        v[nod]=1;
        if(mini==1000000) ok=1;
        else{
        for(i=1;i<=n;i++)
        {   if(v[i]==0)if(d[i]>mat[nod][i]+d[nod])
            { d[i]=mat[nod][i]+d[nod];
                t[i]=nod;

            }
        }
        }
    }

}


int main()
{   int i,j,a,b,c,m;
    in>>n>>m;
    for(i=1;i<=m;i++)
    {   in>>a>>b>>c;
        mat[a][b]=c;
        mat[b][a]=c;

    }
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    {
           if(mat[i][j]==0) mat[i][j]=1000000;

    }
    parc(1);
    for(i=2;i<=n;i++)
    if(d[i]==1000000)
    out<<"0"<<" ";
    else
        out<<d[i]<<" ";
    return 0;
}