#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,n,m) for(int i=(n);i<(m);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
#define REPR(i,n) for(int i=(n);i>=0;i--)
#define all(vec) vec.begin(),vec.end()
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using PP=pair<ll,P>;
using vp=vector<P>;
using vpp=vector<PP>;
using vs=vector<string>;
#define fi first
#define se second
#define pb push_back
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename A,typename B>istream&operator>>(istream&is,pair<A,B> &p){is>>p.fi>>p.se;return is;}
template<typename A,typename B>ostream&operator<<(ostream&os,const pair<A,B> &p){os<<"("<<p.fi<<","<<p.se<<")";return os;}
template<typename T>istream&operator>>(istream&is,vector<T> &t){REP(i,t.size())is>>t[i];return is;}
template<typename T>ostream&operator<<(ostream&os,const vector<T>&t){os<<"{";REP(i,t.size()){if(i)os<<",";os<<t[i];}cout<<"}";return os;}
const ll MOD=1000000007LL;
const int INF=1<<30;
const ll LINF=1LL<<60;
int main(){
    int N,M;
    cin>>N>>M;
    struct edge{
        int to;
        ll cost;
    };
    vector<vector<edge>> G(N);
    REP(i,M){
        int a,b;
        ll c;
        cin>>a>>b>>c;
        a--;b--;
        G[a].pb({b,c});
        G[b].pb({a,c});
    }
    vvl d(N,vl(2,LINF));
    d[0][0]=0;
    d[0][1]=0;
    using state=tuple<ll,int,int>;//dist,now,used
    priority_queue<state,vector<state>,greater<state>> que;
    que.push(state(0ll,0,0));
    while(que.size()){
        auto t=que.top();que.pop();
        ll dist=get<0>(t);
        int v=get<1>(t);
        int f=get<2>(t);
        REP(i,G[v].size()){
            edge e=G[v][i];
            if(!f){
                if(d[e.to][1]>dist){
                    d[e.to][1]=dist;
                    que.push(state(dist,e.to,1));
                }
            }
            if(d[e.to][f]>dist+e.cost){
                d[e.to][f]=dist+e.cost;
                que.push(state(d[e.to][f],e.to,f));
            }
        }
    }
    REP(i,N){
        cout<<d[i][0]+d[i][1]<<endl;
    }
    return 0;
}