#include <bits/stdc++.h>

using namespace std;

const int NMAX = 5e4,INF = 1e9;;
vector < pair <int, int> > e[NMAX + 5];
priority_queue < pair<int, int> > pq;
bool viz[NMAX + 5];
int dist[NMAX + 5];

void dijkstra(int src) {
    int node,f,s;
    dist[src] = 0;
    pq.push({0, src});
    while (!pq.empty()) {
        node = pq.top().second;
        pq.pop();
        if (viz[node])
            continue;
        viz[node] = 1;
        for (int i = 0;i < e[node].size();i++) {
            f = e[node][i].first;
            s = e[node][i].second;
            if (!viz[f] && s + dist[node] < dist[f]) {
                dist[f] = s + dist[node];
                pq.push({-dist[f], f});
            }
        }
    }
}
int main()
{
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    int n,m,a,b,c,src = 1;
    fin >> n >> m;
    for (int i = 0;i < m;i++) {
        fin >> a >> b >> c;
        e[a].push_back({b, c});
    }
    for (int i = 1;i <= n;i++)
        dist[i] = INF;
    dijkstra(src);
    for (int i = 2;i <= n;i++)
        if (dist[i] == INF)
            fout << 0 << " ";
        else
            fout << dist[i] << " ";
    return 0;
}