#include <bits/stdc++.h>

#define INF 1 << 30
#define NMAX 50001

using namespace std;

ifstream f ("dijkstra.in");
ofstream g ("dijkstra.out");

int n, m;

vector< pair<int, long long> > vecini[NMAX];
vector<long long> cost;
queue<int> q;

void initCost(){
    cost = vector<long long>(n + 1, INF);
}

void bf(int nod){
    cost[nod] = 0;
    q.push(nod);
    while(!q.empty()){
        int k = q.front();
        q.pop();
        for(auto vecin : vecini[k])
            if(cost[vecin.first] > cost[k] + vecin.second){
                cost[vecin.first] = cost[k] + vecin.second;
                q.push(vecin.first);
            }
    }
}

int main()
{
    int x, y, c;
    f >> n >> m;
    for(int i = 1; i <= m; i ++){
        f >> x >> y >> c;
        vecini[x].push_back(make_pair(y, c));
    }
    initCost();
    bf(1);
    for(int i = 2; i <= n; i ++)
        if(cost[i] == INF) cost[i] = 0;
    for(int i = 2; i <= n; i ++)
        g << cost[i] << " ";
    return 0;
}