#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
#define MAX 50010
#define inf 1000000000
#define mp make_pair
#define cout fout
vector <pair<int, int> > G[MAX];
priority_queue <pair<int, int> > Q;
int viz[MAX], dist[MAX];

int main(){
    int n, m, x, y, c, i, nod;
    fin >> n >> m;
    while(m--){
        fin >> x >> y >> c;
        G[x].push_back(make_pair(y, c));
    }
    for(i = 1 ; i <= n ; i++){
        dist[i] = inf;
    }
    dist[1] = 0;
    Q.push(mp(0, 1));

    while(Q.size()){
        auto aux = Q.top();
        nod = aux.second;
        Q.pop();
        if(viz[nod]){
            continue;
        }
        viz[nod] = 1;
        for(auto v : G[nod]){
            if(dist[v.first] > dist[nod] + v.second){
                dist[v.first] = dist[nod] + v.second;
                Q.push(mp(-dist[v.first], v.first));
            }
        }
    }
    for(i = 2 ; i <= n ; i++){
        cout << ((dist[i] == inf)? 0 : dist[i]) << " ";
    }
    cout << "\n";
}