#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,m;
vector<pii> g[125252];

ll dist[252521];

int main(){
  scanf("%d%d",&n,&m);
  REP(i,m){
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    --a;--b;
    g[a].push_back(pii(b,c));
    g[b].push_back(pii(a,c));
  }
  fill(dist,dist+n+n,1ll<<60);
  priority_queue<pll> Q;
  Q.push(pll(-0,0));
  dist[0] = 0;
  while(!Q.empty()){
    pll P = Q.top(); Q.pop();
    int p = P.second;
    ll d = -P.first;
    if(dist[p] != d)continue;
    bool used = p/n;
    int uuu = used ? n : 0;
    for(pii PP : g[p%n]){
      int to = PP.first;
      int cost = PP.second;
      ll nd = d + cost;
      if(dist[to+uuu] > nd){
        dist[to+uuu] = nd;
        Q.push(pll(-nd,to+uuu));
      }
      if(!used){
        nd = d;
        if(dist[to+n] > nd){
          dist[to+n] = nd;
          Q.push(pll(-nd,to+n));
        }
      }
    }
  }
  REP(i,n){
    ll ans = dist[i] + min(dist[i], dist[i+n]);
    printf("%lld\n",ans);
  }
  return 0;
}