#include <bits/stdc++.h>
#define Nmax 50005
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
struct muchie
{
    int y, c;
};
vector <muchie> v[Nmax];
int n, m, i, x, y, c, k, d[Nmax], minn;
bool ok, viz[Nmax];
int main()
{
    fin >> n >> m;
    for(i=1;i<=m;i++)
    {
        fin >> x >> y >> c;
        v[x].push_back({y, c});
    }
    for(i=1;i<=n;i++)
        d[i]=INT_MAX;
    d[1]=0;
    ok=1;
    while(ok)
    {
        ok=0;
        minn=INT_MAX;
        for(i=1;i<=n;i++)
           if(viz[i]==0&&d[i]<minn)
           {
               minn=d[i];
               k=i;
               ok=1;
           }
        if(ok==0)
            break;
        viz[k]=1;
        for(i=0;i<v[k].size();i++)
            if(d[v[k][i].y]>d[k]+v[k][i].c)
                d[v[k][i].y]=d[k]+v[k][i].c;
    }
    for(i=2;i<=n;i++)
        fout << d[i] << ' ';
    return 0;
}