#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");

vector<pair<int, int> > graph[50001];
int n, m, minRoad[50001];
bool done[50001];

struct compareMethod {
    bool operator() (int a, int b) {
        return minRoad[a] > minRoad[b];
    }
};
priority_queue <int, vector<int>, compareMethod> q;

void dijkstraAlgorithm() {
    while (!q.empty()) {
        int node = q.top();
        for (auto it : graph[node])
            minRoad[it.first] = min(minRoad[it.first], minRoad[node] + it.second);
        done[node] = true;
        q.pop();
    }
}

int main() {
    fin.tie(0);
    ios::sync_with_stdio(0);
    fin >> n >> m;
    int a, b, c;
    for (int i = 0; i < m; i++) {
        fin >> a >> b >> c;
        graph[a].push_back(make_pair(b, c));
    }

    for (int i = 1; i <= n; i++) {
        if (i > 1)
            minRoad[i] = INT_MAX;
        q.push(i);
    }
    dijkstraAlgorithm();

    for (int i = 2; i <= n; i++) {
        if (minRoad[i] == INT_MAX)
            cout << "0 ";
        else
            cout << minRoad[i] << " ";
    }

    /*for (int i = 1; i <= n; i++) {
        cout << i << " -> ";
        for (auto it : graph[i])
            cout << "(" << it.first << ", " << it.second << "); ";
        cout << "\n";
    }*/
    return 0;
}