/* -*- coding: utf-8 -*-
 *
 * 807.cc:  No.807 umg tours - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const long long LINF = 1LL << 62;

/* typedef */

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<pii> vpii;

struct Stat {
  ll d;
  int i, j;
  Stat() {}
  Stat(ll _d, int _i, int _j): d(_d), i(_i), j(_j) {}
  bool operator<(const Stat &s) const { return d > s.d; }
};

/* global variables */

vpii nbrs[MAX_N];
ll dp[MAX_N][2];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < m; i++) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    a--, b--;
    nbrs[a].push_back(pii(b, c));
    nbrs[b].push_back(pii(a, c));
  }

  for (int i = 0; i < n; i++) dp[i][0] = dp[i][1] = LINF;
  dp[0][0] = 0;

  priority_queue<Stat> q;
  q.push(Stat(0, 0, 0));

  while (! q.empty()) {
    Stat u = q.top(); q.pop();
    if (dp[u.i][u.j] != u.d) continue;

    vpii &nbru = nbrs[u.i];
    for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
      int &vi = vit->first;
      ll vd = u.d + vit->second;

      if (dp[vi][u.j] > vd) {
	dp[vi][u.j] = vd;
	q.push(Stat(vd, vi, u.j));
      }

      if (u.j == 0 && dp[vi][1] > u.d) {
	dp[vi][1] = u.d;
	q.push(Stat(u.d, vi, 1));
      }
    }
  }

  for (int i = 0; i < n; i++)
    printf("%lld\n", dp[i][0] + min(dp[i][0], dp[i][1]));

  return 0;
}