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

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

const int INF = 20000 * 100000 + 1; 
vector<pair<int, int>> adj[100001]; 
int d[100001]; 
int n, m, p;

void citire() {
    fin >> n >> m;
    int x, y, z;
    for (int i = 0; i < m; i++) {
        fin >> x >> y >> z;
        adj[x].push_back({y, z});
    }
}

void dijkstra() {
    
    fill(d, d + n + 1, INF);
    d[p] = 0;

    
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    pq.push({0, p});

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

        for (auto edge : adj[u]) {
            int v = edge.first;
            int weight = edge.second;

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

int main() {
    p=1;
    citire();
    dijkstra();
    for (int i = 2; i <= n; i++) {
        if (d[i] == INF)
            fout << 0 << " "; 
        else
            fout << d[i] << " ";
    }
    return 0;
}