#include <bits/stdc++.h>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int NMAX=50005,INF=0x3F3F3F3F;
int n,m,x,y,c;
vector<int>d;
vector<pair<int,int>>v[NMAX];
priority_queue<pair<int,int>>q;
bitset<NMAX>viz;
void dijkstra(int x)
{
    q.push({0,x});
    while(!q.empty())
    {
        x=q.top().second;
        q.pop();
        if(viz[x]==0)
        {
            for(int i=0; i<v[x].size(); i++)
                if(d[x]+v[x][i].second<d[v[x][i].first])
                {
                    d[v[x][i].first]=d[x]+v[x][i].second;
                    q.push({-d[v[x][i].first],v[x][i].first});
                }
            viz[x]=1;
        }
    }
}
int main()
{
    f>>n>>m;
    d=vector<int>(n+1,INF);
    for(int i=1; i<=m; i++)
    {
        f>>x>>y>>c;
        v[x].push_back({y,c});
    }
    d[1]=0;
    dijkstra(1);
    for(int i=2; i<=n; i++)
        if(d[i]==INF)
            g<<0<<" ";
        else
            g<<d[i]<<" ";
    return 0;
}