#include <fstream>
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
struct nod
{
    int c,n;
    nod *urm;
} *g[50010],*p;
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 nod;
        p->n=j;
        p->c=c;
        p->urm=g[i];
        g[i]=p;
    }
    for (i=2;i<=n;i++)
        d[i]=inf;
    for (i=1;i<=n;i++)
        for (p=g[i];p;p=p->urm)
            if (d[i]+p->c<d[p->n])
                d[p->n]=d[i]+p->c;
    for (i=2;i<=n;i++)
        fout<<d[i]<<' ';
    fout<<'\n';
    fin.close ();
    fout.close ();
    return 0;
}