#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 50010;
const int inf = 1e9;
vector < pair < int, int > > v[NMAX];
int n,m,dist[NMAX],viz[NMAX];

int main(){
    int i,j;
    f >> n >> m;
    for(int i = 1 ; i <= n ; i++){
        int x, y, z;
        f >> x >> y >> z;
        v[x].push_back({y,z});
        //v[y].push_back({x,z});
    }

    for(int i = 2 ; i <= n ; i++)
        dist[i] = inf;

    priority_queue < pair < int, int > > q;
    q.push({0,1});
    while(!q.empty()){
        int node = q.top().second;
        q.pop();

        if(viz[node])
            continue;
        viz[node] = 1;

        for(auto it : v[node])
            if(dist[it.first] > dist[node] + it.second){
                dist[it.first] = dist[node] + it.second;
                q.push({-dist[it.first], it.first});
            }
    }

    for(int i = 2 ; i <= n ; i++)
        g << dist[i] << " ";

    return 0;
}