///dijkstra
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int i,m,j,n,l,x,y,d[50010],viz[50010];
struct noduri
{
    int nod, drum;
    bool operator < (const noduri x) const
    {
        return drum>x.drum;
    }
} p;
priority_queue <noduri> q;
vector <noduri> v[50010];
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>l;
        v[x].push_back({y,l});
    }
    for(i=2; i<=n; i++)
        d[i]=INT_MAX;
    d[1]=0;
    q.push({1,0});
    while(!q.empty())
    {
        p=q.top();
        q.pop();
        if(viz[p.nod])
            continue;
        viz[p.nod]=1;
        for(auto it : v[p.nod])
            if(d[it.nod]>d[p.nod]+it.drum)
            {
                d[it.nod]=d[p.nod]+it.drum;
                q.push({it.nod,d[it.nod]});
            }
    }
    for(i=2; i<=n; i++)
    {
        if(d[i]<INT_MAX)
            fout<<d[i]<<" ";
        else
            fout<<0<<" ";
    }

    return 0;
}