#include <fstream>
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
struct muchii
{
    int i,j,c;
    muchii *urm;
} *p,*q;
int d[50010],i,j,k,n,m,inf=2000000000,c;
int main()
{
    fin>>n>>m;
    for (k=1;k<=m;k++)
    {
        fin>>i>>j>>c;
        p=new muchii;
        p->i=i;
        p->j=j;
        p->c=c;
        p->urm=q;
        q=p;
    }
    for (i=2;i<=n;i++)
        d[i]=inf;
    for (i=1;i<=n;i++)
    {
        /*for (j=2;j<=n;j++)
            fout<<d[j]<<' ';
        fout<<'\n';*/
        for (p=q;p;p=p->urm)
            if (d[p->i]+p->c<d[p->j])
                d[p->j]=d[p->i]+p->c;
    }
    //fout<<'\n';
    for (i=2;i<=n;i++)
        fout<<d[i]<<' ';
    fout<<'\n';
    fin.close ();
    fout.close ();
    return 0;
}