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

using namespace std;

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

int n, m, dist[100001], viz[100001];
vector<pair<int, int>> gf[100001];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
const int INF = 2e9;

void dijkstra(int start) {
    dist[start] = 0;
    pq.push({ dist[start], start });
    viz[start] = 1;
    while (!pq.empty()) {
        int cost = pq.top().first;
        int nod = pq.top().second;
        pq.pop();
        if (viz[nod])
            continue;
        viz[nod] = 1;
        for (auto vecin : gf[nod]) {
            int costnou = vecin.first;
            int nodnou = vecin.second;
            if (!viz[nodnou] && dist[nodnou] > dist[nod] + costnou) {
                dist[nodnou] = dist[nod] + costnou;
                pq.push({ dist[nodnou], nodnou });
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y, c;
        fin >> x >> y >> c;
        gf[x].push_back({ c, y });
    }
    for (int i = 1; i <= n; i++)
        dist[i] = INF;
    dijkstra(1);
    for (int i = 2; i <= n; i++)
        if (dist[i] == INF)
            fout << "0 ";
        else fout << dist[i] << " ";
    return 0;
}