#include <bits/stdc++.h>
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
const int NMAX=50005;
const int INF=INT_MAX;
priority_queue <pair <int, int> > pq;
vector <pair<int, int> > G[NMAX];
int n,m,dist[NMAX],x,y,c;
bool viz[NMAX];
void dijkstra()
{
    int nod,nodd,cost;
    viz[1]=false;
    pq.push({0,1});
    while(!pq.empty())
    {
        nod=pq.top().second;
        pq.pop();
        if(viz[nod]) continue;
        viz[nod]=true;
        for(int i=0; i<G[nod].size(); i++)
        {
            nodd=G[nod][i].second;
            cost=G[nod][i].first;
            if(dist[nod]-cost<dist[nodd])
            {
                dist[nodd]=dist[nod]-cost;
                pq.push({-dist[nodd],nodd});
            }
        }
    }
}
void citire()
{
    fin>>n>>m;
    dist[1]=0;
    for(int i=2; i<=n; i++) dist[i]=INF;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        G[x].push_back({-c,y});
    }
}
void afisare()
{
    for(int i=2; i<=n; i++)
        if(dist[i]==INF) fout<<"0 ";
        else fout<<dist[i]<<" ";

}
int main()
{
    citire();
    dijkstra();
    afisare();
    return 0;
}