#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> Nod[MAX];
priority_queue <pairINT, vector <pairINT>, greater <pairINT>> pQ;

void read();
void dijkastra();
void ans();

int main(){
    read();
    dijkastra();
    ans();
    return 0;
}
void dijkastra(){
    int i,x,cost;

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

    while(!pQ.empty()){
        cost=pQ.top().first;
        x=pQ.top().second;
        pQ.pop();

        if(Used[x]&&Dist[x]<=cost)
            continue;
        Used[x]=1;
        Dist[x]=cost;

        for(auto it:Nod[x]){
            if(!Used[it.second] || cost+it.first<Dist[it.second]){
                pQ.push(make_pair(cost+it.first, it.second));
            }
        }
    }
}
void read(){
    int i,m,x,y,cost;
    fin>>n>>m;
    for(i=0;i<m;++i){
        fin>>x>>y>>cost;
        Nod[x].push_back(make_pair(cost,y));
//        Nod[y].push_back(make_pair(cost,x));
    }
}
void ans(){
    int i;
    for(i=2;i<=n;++i)
        fout<<Dist[i]<<' ';
}