#include <bits/stdc++.h>
#define MAX 50005
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
typedef pair <int,int> pairINT;

int n,dist[MAX];
bool used[MAX];
vector <pairINT> g[MAX];
set <pairINT> pQ;

void read();
void dijkstra();
void ans();

int main(){
    read();
    dijkstra();
    ans();
    return 0;
}
void dijkstra(){
    int i,node,cost;

    pQ.insert(make_pair(0,1));

    while(!pQ.empty()){
        cost=(*pQ.begin()).first;
        node=(*pQ.begin()).second;
        pQ.erase(pQ.begin());
        used[node]=0;

        for(auto it:g[node]){
            if(dist[it.first] > dist[node]+it.second){
                if(used[it.first])
                    pQ.erase(pQ.find({dist[it.first], it.first}));
                used[it.first]=1;

                dist[it.first]=dist[node]+it.second;

                pQ.insert(make_pair(dist[it.first], it.first));
            }
        }
    }
}
void read(){
    int i,m,x,y,cost;
    fin>>n>>m;
    for(i=2;i<=n;++i)
        dist[i]=1e9;

    for(i=0;i<m;++i){
        fin>>x>>y>>cost;
        g[x].push_back(make_pair(y, cost));
    }
}
void ans(){
    int i;
    for(i=2;i<=n;++i)
        fout<<((dist[i] !=1e9) ? dist[i] : 0)<<' ';
}