#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
#define Mod 1000000007
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;


#define INF 10000000000000000
#define MAX_V 1000000

struct edge{ll to,cost;};
ll d[MAX_V];
ll V;
vector<edge> G[MAX_V];

edge makeedge(ll t,ll c){
    edge e;
    e.to=t;
    e.cost=c;
    return e;
}

void addedge(ll s,ll t,ll c){
    G[s].push_back(makeedge(t,c));
    G[t].push_back(makeedge(s,c)); //双方向
}

void addedge2(ll s,ll t,ll c){
    G[s].push_back(makeedge(t,c));
    //G[t].push_back(makeedge(s,c)); //双方向
}

void dijkstra(ll s){
    priority_queue<P, vector<P>, greater<P> > que;
    fill(d,d+V,INF);
    d[s]=0;
    que.push(P(0,s)); 

    while(!que.empty()){
        P p=que.top(); que.pop();
        ll v=p.second;
        if(d[v]<p.first) continue;
        for(ll i=0;i<G[v].size();i++){
            edge &e=G[v][i];
            if(d[e.to]>d[v]+e.cost){
                d[e.to]=d[v]+e.cost;
                que.push(P(d[e.to],e.to));
            }
        }
    }
}



int main(){
    ll i,j;
    ll n,m;
    cin>>n>>m;
    V=2*n;
    ll a,b,c;
    for(i=0;i<m;i++){
        cin>>a>>b>>c;
        a--;
        b--;
        addedge(2*a,2*b,c);
        addedge(2*a+1,2*b+1,c);
        addedge2(2*a,2*b+1,0);
        addedge2(2*b,2*a+1,0);
    }
    dijkstra(0);

    cout<<0<<endl;
    for(i=1;i<n;i++){
        cout<<d[i*2]+d[i*2+1]<<endl;
    }
    
    return 0;
}