#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;
const int MAX = 50005;
const int INF = 1e9;
vector<pair<int, int> > G[MAX + 1];
int d[MAX + 1], viz[MAX + 1], tata[MAX + 1];

int main() {
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y, c;
        cin >> x >> y >> c;
        G[x].push_back({y, c});
    }
    for (int i = 1; i <= n; i++) {
        d[i] = INF;
    }
    priority_queue<pair<int, int> > pq;
    d[1] = 0;
    pq.push({-d[0], 1});
    while (!pq.empty()) {
        pair<int, int> p = pq.top();
        int nod = p.second;
        pq.pop();
        if (viz[nod] == 0) {
            viz[nod] = 1;

            for (const auto &p: G[nod]) {
                int vecin = p.first;
                if (d[vecin] > d[nod] + p.second) {
                    d[vecin] = d[nod] + p.second;
                    pq.push({-d[vecin], vecin});
                    tata[vecin] = nod;
                }
            }
        }
    }
    for (int i = 2; i <= n; i++) {
        if (d[i] != INF) {
            cout << d[i] << " ";
        } else {
            cout << 0 << " ";
        }
    }
    return 0;
}