#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
int N,M;
vector<vector<P>> v(200010);
ll dp[200010] = {},inf = 1e18;

int main(){
    cin >> N >> M;
    assert(2<=N && N<=100000);
    assert(N-1<=M && M<=min(200000,N*(N-1)/2));
    int a,b; ll c;
    set<pair<int,int>> s;
    for(int i=0;i<M;i++){
        cin >> a >> b >> c;
        if(a>b) swap(a,b);
        assert(s.count({a,b})==0);
        assert(1<=a && a<=N && 1<=b && b<=N && 1<=c && c<=1000000000);
        assert(a!=b);
        v[a].push_back(P(c,b));
        v[a].push_back(P(0,b+N));
        v[b].push_back(P(c,a));
        v[b].push_back(P(0,a+N));
        v[a+N].push_back(P(c,b+N));
        v[b+N].push_back(P(c,a+N));
        s.insert({a,b});
    }
    for(int i=2;i<=2*N;i++){
        if(i!=N+1) dp[i] = inf;
    }
    priority_queue<P,vector<P>,greater<P>> Q,Q2;
    Q.push(P(0,1));
    int cnt = 0;
    while(!Q.empty()){
        P p = Q.top(); Q.pop();
        int n = p.second;
        if(dp[n]<p.first) continue;
        for(auto x:v[n]){
           if(dp[x.second]>p.first+x.first){
                dp[x.second] = p.first+x.first;
                Q.push(P(dp[x.second],x.second));
            }
        }
    }
/*    Q2.push(P(0,1));
    while(!Q2.empty()){
        P p = Q2.top(); Q2.pop();
        int n = p.second;
        if(dp[n][1]<p.first) continue;
        for(auto x:v[n]){
            if(dp[x.second][1]>min(dp[n][1]+x.first,dp[n][0])){
                dp[x.second][1] = min(dp[n][1]+x.first,dp[n][0]);
                Q2.push(P(dp[x.second][1],x.second));
            }
        }
    }
*/    for(int i=1;i<=N;i++){
        assert(dp[i]!=inf && dp[i+N]!=inf);
        cout << dp[i]+dp[i+N] << endl;
    }
}