#include <iostream>
#include <queue>
#include <vector>
#include <fstream>

using namespace std;

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

vector<vector<pair<int, int>>> adj;
vector<int> dist;
vector<int> parent;
int n, m;

void djikstra(int start) {
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    dist[start] = 0;
    pq.push({0, start});
    while (!pq.empty()) {
        auto [d, node] = pq.top();
        pq.pop();

        if (d != dist[node])
            continue;

        for (auto [vecin, cost] : adj[node]) {
            if (dist[vecin] > dist[node] + cost) {
                dist[vecin] = dist[node] + cost;
                parent[vecin] = node;
                pq.push({dist[vecin], vecin});
            }
        }
    }
}

int main() {
    fin >> n >> m;
    adj.resize(n+1);
    dist.resize(n+1, 1e9);
    parent.resize(n+1, -1);
    for (int i = 0; i < m; i++) {
        int u, v, w;
        fin >> u >> v >> w;
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
    }
    djikstra(1);
    for (int i = 2; i <= n; i++) {
        fout << dist[i] << " ";
    }
}