#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
typedef pair<ll, lpair> lpair2;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " ";} cout<<endl;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N,M;
    cin >> N >> M;
    ll A[100010], B[100010], C[100010];
    vector<lpair> tree[100010];
    rep(i,0,M){
        cin >> A[i] >> B[i] >> C[i];
        A[i]--; B[i]--;
        tree[A[i]].push_back(make_pair(B[i], C[i]));
        tree[B[i]].push_back(make_pair(A[i], C[i]));
    }
    // ll dist1[100010] = {}, dist2[100010];
    // rep(i,1,N){
    //     dist1[i] = INF;
    //     dist2[i] = INF;
    // }
    ll dp[100010][2] = {};
    rep(i,1,N){
        dp[i][0] = INF;
        dp[i][1] = INF;
    }
    priority_queue<lpair2, vector<lpair2> ,greater<lpair2> > pq;
    rep(i,0,N) pq.push(make_pair(dp[i][0], make_pair(0,i)));
    rep(i,0,N) pq.push(make_pair(dp[i][1], make_pair(1,i)));
    ll is_visit[100010][2] = {};
    // ll max_length[100010] = {};
    while(!pq.empty()){
        lpair2 l1 = pq.top();
        ll len = l1.first;
        ll t1 = l1.second.first;
        ll pos = l1.second.second;
        pq.pop();
        is_visit[pos][t1] = 1;
        for(auto &e: tree[pos]){
            if(t1 == 0){
                // if(dp[e.first][0] > dp[pos][0]){
                //     if(!is_visit[e.first][0]){
                //         dp[e.first][0] = dp[pos][0];
                //         pq.push(make_pair(dp[e.first][0], make_pair(e.first, 0)));
                //     }
                // }
                if(dp[e.first][0] > dp[pos][0] + e.second){
                    if(!is_visit[e.first][0]){
                        dp[e.first][0] = dp[pos][0] + e.second;
                        pq.push(make_pair(dp[e.first][0], make_pair(0,e.first)));
                    }                
                }
                if(dp[e.first][1] > dp[pos][0]){
                    if(!is_visit[e.first][1]){
                        dp[e.first][1] = dp[pos][0];
                        pq.push(make_pair(dp[e.first][1], make_pair(1,e.first)));
                    }
                }


            }else{
                if(dp[e.first][1] > dp[pos][1] + e.second){
                    if(!is_visit[e.first][1]){
                        dp[e.first][1] = dp[pos][1] + e.second;
                        pq.push(make_pair(dp[e.first][1], make_pair(1,e.first)));
                    }                
                }

            }
            // if(dist[e.first] > dist[l1.second] + e.second){
            //    if(!is_visit[e.first]){
            //         dist[e.first] = dist[l1.second] + e.second;
            //         max_length[e.first] = max(max_length[l1.second], e.second);
            //         pq.push(make_pair(dist[e.first], e.first));
            //     }                
            // }
        } 
    }
    rep(i,0,N){
        print(dp[i][0] + dp[i][1]);
    }
    // printa(max_length, N);
    
}