#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<pair<int, int>> v[250005];
int d[250005];
set<pair<int, int>> s;
#define INF 900000000000000000
signed main()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        int a, b, c;
        cin >> a >> b >> c;
        v[a].push_back({b, c});
    }
    d[1] = 0;
    for(int i = 2; i <= n; i++)
        d[i] = INF;
    s.insert({0, 1});
    while(!s.empty()){
        int nod = s.begin()->second;
        s.erase(s.begin());
        for(auto p : v[nod]){
            int to = p.first;
            int len = p.second;
            if(d[to] > d[nod] + len){
                s.erase(p);
                d[to] = d[nod] + len;
                s.insert({d[to], to});
            }
        }
    }
    for(int i = 2; i <= n; i++){
        if(d[i] == INF)
            cout << 0 << " ";
        else
            cout << d[i] << " ";
    }
    return 0;
}