#include <bits/stdc++.h>

#define mp make_pair
#define f first
#define s second
#define nmax 50009
#define pb push_back
#define inf INT_MAX
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
priority_queue <pair<int,int> ,vector < pair <int,int> > ,greater <pair <int,int> > > h;
vector <pair <int,int> > v[nmax];
int n,m,a,b,c,d[nmax],i,nod;
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        v[a].pb(mp(c,b));
    }
    h.push(mp(0,1));
    d[1]=0;
    for(i=2;i<=n;i++)
        d[i]=inf;
    while(!h.empty())
    {
        nod=h.top().s;
        h.pop();
        for(i=0;i<v[nod].size();i++)
        {
            if(d[nod]+v[nod][i].f<d[v[nod][i].s])
            {
                d[v[nod][i].s]=d[nod]+v[nod][i].f;
                h.push(mp(d[v[nod][i].s],v[nod][i].s));
            }
        }
    }
    for(i=2;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}