#include <bits/stdc++.h>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;

const string fisier = "dijkstra";

ifstream fin (fisier + ".in");
ofstream fout (fisier + ".out");

const int N_MAX = 50005;

set<pair<int , int>>s;
vector<pair<int , int>>g[N_MAX];
int d[N_MAX] , n , m;

int main(){
    ios_base::sync_with_stdio(false);
    fin >> n >> m;
    for (int i=1; i<=m; i++){
        int x , y , cost; fin >> x >> y >> cost;
        g[x].push_back({y , cost});
    }
    for (int i=1; i<=n; i++){
        d[i] = INF;
    }
    d[1] = 0;
    s.insert({1 , 0});
    while (s.empty() == false){
        int node = s.begin()->first;
        s.erase(s.begin());
        for (int i=0; i<(int)g[node].size(); i++){
            int new_node = g[node][i].first , new_cost = g[node][i].second;
            if (d[new_node] > d[node] + new_cost){
                if (d[new_node] != INF){
                    s.erase(s.find(make_pair(new_node , d[new_node])));
                }
                d[new_node] = d[node] + new_cost;
                s.insert({new_node , d[new_node]});
            }
        }
    }
    for (int i=2; i<=n; i++){
        fout << ((d[i] == INF) ? 0 : d[i]) << " ";
    }
}