#include <bits/stdc++.h>
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n, m, p, i, j, x;
vector <pair<int, int>> a[100002];
vector <int> d;

void dijkstra(int start_node) {
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    pq.push({0, start_node});
    d[start_node] = 0;
    while(!pq.empty()) {
        int dist_curenta = pq.top().first;
        int nod = pq.top().second;
        pq.pop();
        if(dist_curenta > d[nod])
            continue;
        for (pair<int, int> it : a[nod]) {
            int vecin = it.first;
            int cost = it.second;
            if (d[nod] + cost < d[vecin]) {
                d[vecin] = d[nod] + cost;
                pq.push({d[vecin], vecin});
            }
        }
    }
}

int main()
{
    f >> n >> m;
    d.resize(n + 1, INT_MAX);
    for (int k = 0; k < m; k++) {
        f >> i >> j >> x;
        a[i].emplace_back(j, x);
        a[j].emplace_back(i, x);
    }
    dijkstra(1);
    for (int i = 2; i <= n; i++)
        if (d[i] != INT_MAX)
            g << d[i] << " ";
        else
            g << 0 << " ";

    return 0;
}