#include <fstream>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

typedef struct
{
    int x,y,t;
} drum;
drum a[250000];

int n,m,v[50100],i;
bool ok;

int main()
{
    f >> n >> m;
    for (i=0; i<m; i++)
        f >> a[i].x >> a[i].y >> a[i].t;
    fill_n(v,n+2,-1);
    v[1]=0;
    ok=1;
    while (ok)
    {
        ok=0;
        for (i=0; i<m; i++)
            if (v[a[i].x]!=-1 && (v[a[i].y]==-1 || v[a[i].y]>v[a[i].x]+a[i].t))
            {
                v[a[i].y]=v[a[i].x]+a[i].t;
                ok=1;
            }
    }
    for (i=2; i<=n; i++)
        if (v[i]==-1) g << 0 << ' '; else g << v[i] << ' ';
}