#include <fstream>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

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

vector<int> dijkstra(const vector<vector<pair<int, int>>> &adj, int start) {
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    vector<int> dist(adj.size() + 1, INT_MAX);
    dist[start] = 0;
    pq.push({0, start});

    while(!pq.empty()) {
        auto top = pq.top();
        pq.pop();
        int u = top.second;
        int d = top.first;

        if(d > dist[u]) continue;

        for (auto &neighbor : adj[u]) {
            int v = neighbor.first;
            int w = neighbor.second;

            if(dist[u] + w < dist[v]) {
                dist[v] = dist[u] + w;
                pq.push({dist[v], v});
            }
        }
    }

    return dist;
}

int main() {
    int n, m;
    fin >> n >> m;
    vector<vector<pair<int, int>>> adj(n + 1);
    vector<bool> visited(n + 1, false);

    for (int i = 0;  i < m; ++i) {
        int u, v, w;
        fin >> u >> v >> w;
        adj[u].push_back({v, w});   
    }

    vector<int> dist = dijkstra(adj, 1);
    for (int i = 2; i <= n; ++i) {
        fout << dist[i] << ' ';
    }

    return 0;
}