#include <fstream>
#define NMAX 20001
#define INF 1<<30
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,m,d[NMAX],viz[NMAX];
typedef struct nod
{
    int y,cost;
    nod *urm;
}*pNod;
pNod lis[NMAX];
void add(pNod &dest, int val,int costu)
{
    pNod p;
    p=new nod;
    p->y=val;
    p->cost=costu;
    p->urm=dest;
    dest=p;
}
void Dijkstra(int x0)
{
    int i, j, min, k, ok;
    for(int i=1;i<=n;++i)
        d[i]=INF;
    for(pNod p=lis[x0];p!=NULL;p=p->urm)
        d[p->y] = p->cost;
    viz[x0] = 1; ok = 1;
    while (ok)
    {
        min = INF;
        for (i = 1; i<=n; ++i)
            if (!viz[i] && min>d[i])
            {
                min = d[i];
                k = i;
            }
        if (min != INF) {
            viz[k] = 1;
            for(pNod p=lis[k];p!=NULL;p=p->urm)
               if (!viz[p->y] && d[p->y]>d[k]+p->cost)
               {
                   d[p->y] = d[k]+p->cost;
               }
        }
        else ok = 0;
    }
}
int main()
{
    f>>n>>m;
    int i,j,x,y,z;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        add(lis[x],y,z);
    }
    Dijkstra(1);
    for(i=2;i<=n;i++)
        {   if(d[i]==INF)
                g<<0<<" ";
            else
                g<<d[i]<<" ";
        }
    f.close();
    g.close();
    return 0;
}