#include <bits/stdc++.h>
using namespace std;

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

const int inf = (1<<31)-1;

vector <pair<int,int> > g[50002];
int dist[50002];

int n,m;

priority_queue < pair<int, int> , vector< pair<int, int> > , greater< pair<int, int> > > q;
void djk(int start){

    for(int i = 1; i<=n; i++)
        dist[i] = inf;
    dist[start] = 0;
    q.push({0, start});
    pair<int, int> current;


    while(!q.empty()){
        current = q.top();
        q.pop();
        if(current.first > dist[current.second]) continue ;

        for(unsigned int i = 0; i<g[current.second].size(); i++){
            int nb = g[current.second][i].first;
            int c = g[current.second][i].second;

            if(dist[current.second] + c < dist[nb]){
                dist[nb] = dist[current.second] + c;
                q.push({dist[nb], nb});
            }
        }
    }

}

int main(){
    fin >> n>>m;
    for(int i = 1; i<=m; i++){
        int x,y,c;
        fin>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }

    djk(1);
    for(int i = 2; i <= n; i++){
        if(dist[i] != inf)
            fout << dist[i] <<" ";
        else
            fout << "0 ";
    }



    return 0;
}