#include <bits/stdc++.h>

using namespace std;

string name ="dijkstra";

ifstream fin(name+".in");
ofstream fout(name + ".out");


vector<vector<pair<int,int>>> grph = vector<vector<pair<int,int>>>(51000);
vector<int> d = vector<int>(51000,INT_MAX);
vector<int> vis = vector<int>(51000,0);
queue<int> q;
void dijktra(int st){
    d[st] = 0;
    q.push(st);
    while (!q.empty()){
        int h = q.front();
        q.pop();
        vis[h] = 1;
        for (const auto &item: grph[h]){
            if(vis[item.first]==0){
                q.push(item.first);
                if(d[h]+item.second<=d[item.first])
                    d[item.first] =  d[h]+item.second;
            }

        }


    }

}


int main(){
    int n,m;
   fin>>n>>m;

    for(int i=0;i<m;++i){
        int x,y,z;
        fin>>x>>y>>z;
        grph[x].push_back(make_pair(y,z));
    }

    dijktra(1);

    for (int i=2;i<=n;i++) {
        fout<<(d[i]==INT_MAX?0:d[i])<<" ";

    }

}