#include <iostream>
#include <cstdio>
#include <vector>
#include <bitset>

using namespace std;

const int MAXN = 50005;
const int INF = 1e9 + 5;

vector<pair<int, int>> g[MAXN];
bitset<MAXN> viz;
int dist[MAXN];
int n, m;

void calcDist(int start) {
    for (int i = 1; i <= n; ++i)
        dist[i] = INF;
    dist[start] = 0;
    for (int pas = 1; pas <= n; ++pas) {
        int nodMin = 0, distMin = INF;
        for (int i = 1; i <= n; ++i) {
            if (!viz[i] && dist[i] < distMin) {
                distMin = dist[i];
                nodMin = i;
            }
        }
        if (nodMin == 0 || distMin == INF) break;
        viz[nodMin] = true;
        for (auto& muchie : g[nodMin]) {
            int vecin = muchie.first;
            int cost = muchie.second;
            if (dist[vecin] > dist[nodMin] + cost)
                dist[vecin] = dist[nodMin] + cost;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    cin >> n >> m;
    for(int i = 1; i <= m; ++i) {
        int x, y, c;
        cin >> x >> y >> c;
        g[x].push_back({y, c});
    }
    calcDist(1);
    for (int i = 2; i <= n; ++i) {
        if (dist[i] == INF) cout << 0 << " ";
        else cout << dist[i] << " ";
    }
    return 0;
}