#include <bits/stdc++.h>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int nmax = 5e4;
int n, m;
vector< pair<int, int> > adj[nmax + 1];

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

priority_queue < pair<int, int> > pq;
int d[nmax + 1];
const int inf = 999999999;
void dijkstra(int start) {
    for(int i = 1; i <= n; i ++) {
        d[i] = inf;
    }

    d[start] = 0;
    pq.push({0, start});

    while (!pq.empty()) {
        int nod = pq.top().second;
        pq.pop();

        for (auto &v : adj[nod]) {
            int vecin = v.first;
            int cost = v.second;
            if (d[vecin] > d[nod] + cost) {
                d[vecin] = d[nod] + cost;
                pq.push({(-1) * cost, vecin});
            }
        }
    }
}

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