#include <bits/stdc++.h>

#define NMax 50005
#define INF 0x3f3f3f3f
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,m,x,y,c;
int dist[NMax];
vector<pair<int,int> > G[NMax];
set<pair<int,int> > H;

int main()
{
    memset(dist,INF,sizeof(dist));
    f >> n >> m;
    for(int i = 1; i <= m; ++i){
        f >> x >> y >> c;
        G[x].push_back(make_pair(y,c));
    }
    dist[1] = 0;
    H.insert(make_pair(0,1));
    while(!H.empty()){

        int nod = (*H.begin()).second;
  //
        H.erase(*H.begin());
        for(int i = 0; i < G[nod].size(); ++i){
            if(dist[G[nod][i].first] > dist[nod] + G[nod][i].second){

                dist[G[nod][i].first] = dist[nod] + G[nod][i].second;
              //  g << dist[nod] << '\n';
                H.insert(make_pair(dist[G[nod][i].first],G[nod][i].first));
            }
        }
    }
    for(int i = 2; i <= n; ++i){
        if(dist[i] == INF)
            g << 0 << ' ';
        else
            g << dist[i] << ' ';
    }
    return 0;
}