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

/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real = xxx::number<xxx::cpp_dec_float<1024>>;
*/

#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0, sizeof(x))
#define mm(x) memset((x), -1, sizeof(x))

//container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
  sort(ALL(c)); \
  for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))

// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;

// bit_macro
#define bit(n) (1LL << (n))
#define bitset(a, b) (a) |= (1 << (b))
#define bitunset(a, b) (a) &= ~(1 << (b))
#define bitcheck(a, b) ((((a) >> (b)) & 1) == 1)
#define bitcount(a) __builtin_popcountll((a))

//typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;

//constant
constexpr int INF = (int)1e18;
constexpr int MOD = (int)1e9 + 7;
constexpr double PI = (double)acos(-1);
constexpr double EPS = (double)1e-10;
constexpr int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
constexpr int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};

//
template <typename T>
void chmax(T &a, T b) { a = max(a, b); }
template <typename T>
void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

//
struct Accelerate_Cin {
  Accelerate_Cin() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
  };
};

struct edge {
  int to, cost;
};

int N, M;
vector<edge> G[101010];

int dist[2][101010]; //dp[s][n]:=残りチケットがｓ枚のとき、nまでの最短距離

void dijkstra() {
  typedef pair<int, P> T; //pair<頂点までの最短距離、P(残りチケット、頂点)＞:=T(d,s,v)
  priority_queue<T, vector<T>, greater<T>> que;
  que.push(T(0, P(0, 0)));
  que.push(T(0, P(1, 0)));

  while (!que.empty()) {
    T t = que.top();
    que.pop();
    int d = t.first, s = t.second.first, v = t.second.second;

    if (d > dist[s][v]) continue;

    //not use
    for (auto e : G[v]) {
      if (dist[s][e.to] > d + e.cost) {
        dist[s][e.to] = d + e.cost;
        que.push(T(dist[s][e.to], P(s, e.to)));
      }
    }

    if (s == 1) {
      for (auto e : G[v]) {
        if (dist[0][e.to] > d) {
          dist[0][e.to] = d;
          que.push(T(dist[0][e.to], P(0, e.to)));
        }
      }
    }
  }
}

signed main() {
  cin >> N >> M;
  for (int i = 0; i < M; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    a--, b--;
    G[a].push_back({b, c});
    G[b].push_back({a, c});
  }

  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < 101000; j++) {
      dist[i][j] = INF;
    }
  }

  dist[0][0] = dist[1][0] = 0;

  dijkstra();

  for (int i = 0; i < N; i++) {
    cout << dist[0][i] + dist[1][i] << endl;
  }
  return 0;
}