#include <fstream>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

const int INF = INT_MAX;

int main() {
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    int n, m;
    fin >> n >> m;
    vector<vector<pair<int, int>>> graf(n + 1);
    for (int i = 0; i < m; i++) {
        int a, b, c;
        fin >> a >> b >> c;
        graf[a].push_back({b, c});
    }
    vector<int> dist(n + 1, INF);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    dist[1] = 0;
    pq.push({0, 1});
    while (!pq.empty()) {
        int d = pq.top().first;
        int nod = pq.top().second;
        pq.pop();
        if (d > dist[nod]) {
            continue;
        }
        for (int i = 0; i < graf[nod].size(); i++) {
            int vecin = graf[nod][i].first;
            int cost = graf[nod][i].second;
            if (dist[nod] + cost < dist[vecin]) {
                dist[vecin] = dist[nod] + cost;
                pq.push({dist[vecin], vecin});
            }
        }
    }
    for (int i = 2; i <= n; i++) {
        if (dist[i] == INF) {
            fout << "0";
        } else {
            fout << dist[i];
        }

        if (i < n) {
            fout << " ";
        }
    }
    fout << "\n";

    fin.close();
    fout.close();

    return 0;
}