#include <bits/stdc++.h>
#define MAXN 50000

using namespace std;

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

int dist[MAXN + 1];
vector <pair<int, int>> graf[MAXN + 1];
priority_queue <pair <int, int>> que;

int main()
{
    int n, m, i, a, b, c, nod, cost, vec, vec_pret;

    fin >> n >> m;

    for(i = 1; i <= m; i++){
        fin >> a >> b >> c;
        graf[a].push_back({b, c});
    }
    for(i = 2; i <= n; i++){
        dist[i] = -1;
    }

    dist[1] = 0;
    que.push(make_pair(0, 1));
    while(!que.empty()){
        nod = que.top().second;
        cost = -que.top().first;
        que.pop();

        if(cost == dist[nod]){
            for(i = 0; i < graf[nod].size(); i++){
                vec = graf[nod][i].first;
                vec_pret = graf[nod][i].second;
                if(dist[vec] == -1 || dist[vec] > dist[nod] + vec_pret){
                    dist[vec] = dist[nod] + vec_pret;
                    que.push(make_pair(-dist[vec], vec));
                }
            }
        }
    }
    for(i = 2; i <= n; i++){
        fout << dist[i] << " ";
    }
    fout << "\n";
    return 0;
}