#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct ceva
{
    int nod;
    long long dist;
} gr;
queue<int>q;
vector<ceva>v[50010];
int n,m,i,j,a,b,x,nod,fr[50010];
bool viz[50010];
long long d[50010],c;
int main()
{
    fin>>n>>m;
    for(i=1; i<=n; i++)
        d[i]=INT_MAX;
    for(i=1; i<=m; i++)
    {
        fin>>a>>b>>c;
        fr[b]++;
        gr.nod=b;
        gr.dist=c;
        v[a].push_back(gr);
    }
    q.push(1);
    viz[1]=1;
    d[1]=0;
    while(!q.empty())
    {
        nod=q.front();
        x=v[nod].size();
        for(i=0; i<x; i++)
        {
            fr[v[nod][i].nod]--;
            if(d[v[nod][i].nod]>d[nod]+v[nod][i].dist)
            {
                d[v[nod][i].nod]=min(d[v[nod][i].nod],d[nod]+v[nod][i].dist);
                q.push(v[nod][i].nod), viz[v[nod][i].nod]=1;
            }
        }
        q.pop();
    }
    for(i=2; i<=n; i++)
        fout<<d[i]<<" ";
    return 0;
}