#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <cassert>
#include <bitset>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <utility>
#include <numeric>
#include <regex>
#include <complex>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
  os<<p.first<<" "<<p.second;
  return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
  is>>p.first>>p.second;
  return is;
}
template<typename T>
istream &operator>>(istream &is,vector<T> &a){
  for(auto &i:a)is>>i;
  return is;
}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
ll myceil(ll a,ll b){return (a+b-1)/b;}
const ll INF=1e18;
int main(){
  int n,m;
  cin>>n>>m;
  vector<vector<P>>to(n);
  rep(i,m){
    int a,b,c;
    cin>>a>>b>>c;
    a--,b--;
    to[a].push_back({b,c});
    to[b].push_back({a,c});
  }
  vector<ll>dst(n*2,INF);
  dst[0]=0;
  minque<P>que;
  que.push({0,0});
  while(!que.empty()){
    ll d=que.top().first;
    int x=que.top().second;
    que.pop();
    if(dst[x]!=d)continue;
    if(x<n){
      for(auto i:to[x]){
        if(chmin(dst[i.first],d+i.second)){
          que.push({dst[i.first],i.first});
        }
        if(chmin(dst[i.first+n],d)){
          que.push({dst[i.first+n],i.first+n});
        }
      }
    }
    else{
      for(auto i:to[x-n]){
        if(chmin(dst[i.first+n],d+i.second)){
          que.push({dst[i.first+n],i.first+n});
        }
      }
    }
  }
  rep(i,n){
    if(i==0)cout<<0<<endl;
    else cout<<dst[i]+dst[i+n]<<endl;
  }
}