#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int NMAX = 50005;
const int INF = (1<<29);
vector < pair<int,int> > v[NMAX];
priority_queue < pair<int,int> > pq;
int dist[NMAX],n,m,x,y,cost;
bool fixat[NMAX];
void init(){
    for(int i=1;i<=n;i++)
        dist[i]=INF;
    dist[1]=0;
}
void citire(){
    fin >> n >> m;
    for(int i=1;i<=m;i++){
        fin >> x >> y >> cost;
        v[x].push_back({y,cost});
    }
}
void dijkstra(){
    pq.push({0,1});
    while(!pq.empty()){
        while(!pq.empty() and fixat[pq.top().second]==true) pq.pop();
        if(pq.empty()) return;
        int node = pq.top().second;
        fixat[node] = true;
        for(int i=0;i<v[node].size();i++){
            int vecin = v[node][i].first;
            int cost = v[node][i].second;
            if(dist[node]+cost<dist[vecin])
                dist[vecin]=dist[node]+cost;
            pq.push({-dist[vecin],vecin});
        }
    }
}
void afis(){
    for(int i=2;i<=n;i++){
        if(dist[i]!=INF) fout << dist[i] << ' ';
        else fout << 0 << ' ';
    }
}
int main()
{
    citire();
    init();
    dijkstra();
    afis();
    return 0;
}