#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef double ld;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m;
vii G[50005];
int dist[50005];


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y, c;
        fin >> x >> y >> c;
        G[x].pb(make_pair(y, c));
    }
    
    for (int i = 1; i <= n; i++) {
        dist[i] = INT_MAX;
    }

    set<ii> s;
    s.insert(make_pair(0, 1));
    while (!s.empty()) {
        int d = s.begin()->first;
        int node = s.begin()->second;
        s.erase(s.begin());

        for (auto &it : G[node]) {
            int vecin = it.first;
            int cost = it.second;
            if (dist[vecin] > d + cost) {
                if (dist[vecin] != INT_MAX) {
                    s.erase(s.find(make_pair(dist[vecin], vecin)));
                }
                dist[vecin] = d + cost;
                s.insert(make_pair(dist[vecin], vecin));
            }
        }
    }
    
    for (int i = 2; i <= n; i++) {
        if (dist[i] == INT_MAX) {
            dist[i] = 0;
        }
        fout << dist[i] << " ";
    }

    return 0;
}