#include <bits/stdc++.h>
#define oo 9999999

using namespace std;

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

vector <pair<int, int>> g[50005];
priority_queue <pair<int, int>> pq;
int distances[50005];
bool visited[50005];

int main()
{
    fin.tie(0); fin.sync_with_stdio(false);
    int n, m, x, y, c; fin>>n>>m;
    for (int i=1; i<=m; i++) {
        fin>>x>>y>>c;
        g[x].push_back({y, c});
    }
    for (int i=2; i<=n; i++) distances[i]=oo;
    pq.push({0, 1});
    while (!pq.empty()) {
        int nod = pq.top().second;
        pq.pop();
        for (pair<int, int> p : g[nod]) {
            int vecin = p.first, cost = p.second;
            int posib_dist = distances[nod]+cost;
            // cout<<nod<<' '<<vecin<<' '<<cost<<' '<<posib_dist<<' '<<distances[vecin]<<endl;
            if (distances[vecin]>posib_dist) {
                distances[vecin] = posib_dist;
                pq.push({-posib_dist, vecin});
            }
        }
    }
    for (int i=2; i<=n; i++) {
        if (distances[i]==oo) fout<<"0 ";
        else fout<<distances[i]<<' ';
    }
    return 0;
}