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

#define INF 1e9

using namespace std;

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

vector<int> dijkstra(int start, vector<vector<pair<int, int>>> &la, int N) {
    vector<int> d(N + 1, INF);  
    vector<int> tata(N + 1, 0), viz(N + 1, 0);

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

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

    while (!pq.empty()) {
        pair<int, int> crt = pq.top();
        pq.pop();

        if (viz[crt.second] == 1) {
            continue;
        }
        viz[crt.second] = 1;

        for (auto& vecin : la[crt.second]) {
            int cost = vecin.first;
            int nod = vecin.second;

            if (d[crt.second] < INF && viz[nod] == 0 && d[crt.second] + cost < d[nod]) {
                d[nod] = d[crt.second] + cost;
                tata[nod] = crt.second;
                pq.push({d[nod], nod});
            }
        }
    }

    return d;
}

int main() {

    int N, M;
    fin >> N >> M;

    vector<vector<pair<int, int>>> la(N + 1);
    for (int i = 0; i < M; i++) {
        int x, y, w;
        fin >> x >> y >> w;

        la[x].push_back({w, y});
    }

    vector<int> d = dijkstra(1, la, N);
    
    for (int i = 2; i <= N; i++) {
        fout << (d[i] == INF ? 0 : d[i]) << ' ';
    }
    return 0;
}