#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

const ll INF=1LL<<60;

struct Edge{
  int to;
  ll w;
  Edge(int to,ll w) : to(to),w(w) {}
};

using Graph=vector<vector<Edge>>;
using pli=pair<ll,int>;

template<class T> bool chmin(T& a,T b){
  if(a>b){
    a=b;
    return true;
  }
  return false;
}

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n,m;
  cin>>n>>m;
  
  Graph G(2*n),H(n);
  rep(i,m){
    int a,b;
    ll w;
    cin>>a>>b>>w;
    a--,b--;
    G[a].push_back(Edge(b,w));
    G[b].push_back(Edge(a,w));
    G[a].push_back(Edge(b+n,0));
    G[b].push_back(Edge(a+n,0));
    G[a+n].push_back(Edge(b+n,w));
    G[b+n].push_back(Edge(a+n,w));
    H[a].push_back(Edge(b,w));
    H[b].push_back(Edge(a,w));
  }
  
  vector<ll> dist(2*n,INF),dist1(n,INF);
  int s=0;
  dist[s]=0;
  dist1[s]=0;
  
  priority_queue<pli,vector<pli>,greater<pli>> que,que1;
  que.push({dist[s],s});
  que1.push({dist1[s],s});
  
  while(!que.empty()){
    int v=que.top().second;
    ll d=que.top().first;
    que.pop();
    
    if(d>dist[v]) continue;

    for(auto e:G[v]){
      if(chmin(dist[e.to],dist[v]+e.w)){
        que.push({dist[e.to],e.to});
      }
    }
  }
  
  while(!que1.empty()){
    int v=que1.top().second;
    ll d=que1.top().first;
    que1.pop();
    
    if(d>dist1[v]) continue;

    for(auto e:H[v]){
      if(chmin(dist1[e.to],dist1[v]+e.w)){
        que1.push({dist1[e.to],e.to});
      }
    }
  }
  
  cout<<0<<endl;
  for(int i=1;i<n;i++) cout<<dist[i+n]+dist1[i]<<endl;
  
  return 0;
}