#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

long long int INF = 3e18;
double Pi = 3.1415926535897932384626;

vector<ll> G[500005];
vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps1,pqps2;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←


#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pd(x) cerr<<"//"<<(x)<<endl;
#define re(i,n) for(i=0;i<n;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl


ll mod = 1000000007;
ll rui(ll number1,ll number2){
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

ll n,m,num,sum,ans,a,b,c,d,e,g,h,i,j,k,w,ok,ng,l,q;
ll x[500005],y[500005],z[500005];
ll cost1[200005],cost2[200005];
char s[500005],t[500005];
bool flag,dame;



int main(){
    cin >> n >> m;
	for(i=0;i<m;i++){
		cin >> a >> b >> c;
		tree[a].pb(P(b,c));
		tree[b].pb(P(a,c));
		tree[a+100000].pb(P(b+100000,c));
		tree[b+100000].pb(P(a+100000,c));
		tree[a].pb(P(b+100000,0ll));
		tree[b].pb(P(a+100000,0ll));
	}
	for(i=1;i<=n;i++){
		cost1[i] = INF;
		cost2[i] = INF;
	}
	for(i=100001;i<=n+100000;i++){
		cost1[i] = INF;
		cost2[i] = INF;
	}
	pqps1.push(P(0,1));
	cost1[1] = 0;
	while(!pqps1.empty()){
		P p = pqps1.top();
		pqps1.pop();
		ll v = p.second;
		if(cost1[v] < p.first)continue;
		for(i=0;i<tree[v].size();i++){
			P x = tree[v][i];
			if(cost1[x.first] > cost1[v] + x.second){
				cost1[x.first] = cost1[v] + x.second;
				pqps1.push(P(cost1[x.first],x.first));
			}
		}
	}
	cost2[100001] = 0;
	pqps2.push(P(0,100001));
	while(!pqps2.empty()){
		P p = pqps2.top();
		pqps2.pop();
		ll v = p.second;
		if(cost2[v] < p.first)continue;
		for(i=0;i<tree[v].size();i++){
			P x = tree[v][i];
			if(cost2[x.first] > cost2[v] + x.second){
				cost2[x.first] = cost2[v] + x.second;
				pqps2.push(P(cost2[x.first],x.first));
			}
		}
	}
	for(i=1;i<=n;i++){
		if(i == 1){
			p(0);
		}else{
			p(cost1[i + 100000] + cost2[i + 100000]);
		}
	}
	//p(ans);
	
	return 0;
}