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

using namespace std;

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


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

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

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

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

        int dist = crt.first;
        int nodCrt = crt.second;

        if (dist != d[nodCrt])
            continue;
            
        for (auto &vecin : la[nodCrt]) {
            int cost = vecin.first;
            int nod = vecin.second;

            if (d[nodCrt] + cost < d[nod]) {
                d[nod] = d[nodCrt] + cost;
                tata[nod] = nodCrt;
                pq.push({d[nod], nod});
            }
        }
    }
    
    vector<int> rez;
    for(int i = 2; i <= N; i++) {
        if (d[i] == 1e9) {
            rez.push_back(0);
        } else {
            rez.push_back(d[i]);
        }
        
    }
    return rez;

}

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> rez = dijkstra(la, N);

    for (auto& elem : rez) {
        fout << elem << " ";
    }
    return 0;
}