#include <bits/stdc++.h>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const int lim=5e4+5;
const int inf=2e9+7;
vector<pair<int,int> > vec[lim];
set<pair<int,int> > s;
int n,m,c,x,y;
int dist[lim];
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;++i)
    {
        in>>x>>y>>c;
        vec[x].push_back({y,c});
    }
    for(int i=2;i<=n;++i)
        dist[i]=inf;
    s.insert({0,1});
    while(!s.empty())
    {
        int d=(*(s.begin())).first;
        int nod=(*(s.begin())).second;
        s.erase(s.begin());
        for(auto x:vec[nod])
        if(dist[x.first]>d+x.second)
        {
            if(dist[x.first]!=inf)
                s.erase(s.find({dist[x.first],x.first}));
            dist[x.first]=d+x.second;
            s.insert({dist[x.first],x.first});
        }
    }
    for(int i=2;i<=n;++i)
    if(dist[i]==inf) out<<0<<' ';
    else out<<dist[i]<<' ';
    out<<'\n';
    return 0;
}