#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a >= b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

struct Edge{
    ll to,cost;
};
template<typename T>
struct Dijkstra{
    vector<T> dist;
    vector<int> prev;
    Dijkstra(vector<vector<Edge>> &g,int s){
        dist=vector<T>(g.size(),numeric_limits<T>::max()/5);
        prev=vector<int>(g.size(),-1);
        using pi=pair<T,int>;
        priority_queue<pi,vector<pi>,greater<pi>> que;
        dist[s]=0;
        que.emplace(dist[s],s);
        while(!que.empty()){
            T cost;int idx;
            tie(cost,idx)=que.top();que.pop();
            if(dist[idx]!=cost)continue;
            for(auto &e:g[idx]){
                T ncost=cost+e.cost;
                if(dist[e.to]<=ncost)continue;
                prev[e.to]=idx;
                dist[e.to]=ncost;
                que.emplace(dist[e.to],e.to);
            }
        }
    }
    vector<int> get_path(int t){//到達できない場合、return=t;
        vector<int> path;
        for (int cur = t; cur != -1; cur = prev[cur]) {
            path.push_back(cur);
        }
        reverse(path.begin(), path.end());
        return path;
    }
};


int main(){
    ll n,m;cin >> n >> m;
    vector<vector<Edge>> g(n*2);
    rep(i,m){
        ll a,b,c;cin >> a >> b >> c;a--;b--;
        g[a].push_back({b,c});
        g[a].push_back({b+n,0});
        g[a+n].push_back({b+n,c});
        g[b].push_back({a,c});
        g[b].push_back({a+n,0});
        g[b+n].push_back({a+n,c});
    }
    rep(i,n)g[i].push_back({i+n,0});
    Dijkstra<ll> dk(g,0);
    rep(i,n)cout << dk.dist[i]+dk.dist[i+n] << endl;
}