#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;

struct Edge { int to, cost; };

template<class T, class Edge> pair< V<T>, V<T> > dijkstra(const VV<Edge>& g, int s = 0) {
  V<T> dist(g.size(), numeric_limits<T>::max());
  VV<> h(g.size());
  V<> dh(g.size());
  using P = pair<T, int>;
  priority_queue< P, V<P>, greater<P> > pque;
  pque.emplace(dist[s] = 0, s);
  while (!pque.empty()) {
    T d; int v;
    tie(d, v) = pque.top(); pque.pop();
    if (d > dist[v]) continue;
    for (const auto& e : g[v]) if (dist[v] + e.cost < dist[e.to]) {
      h[v].push_back(e.to);
      ++dh[e.to];
      pque.emplace(dist[e.to] = dist[v] + e.cost, e.to);
    } 
  }
  V<T> dp(g.size(), 1e18);
  dp[s] = 0;
  V<> vs;
  queue<int> que;
  for (int v = 0; v < g.size(); ++v) if (!dh[v]) {
    que.push(v);
  }
  while (!que.empty()) {
    int v = que.front(); que.pop();
    vs.push_back(v);
    for (int w : h[v]) {
      if (!--dh[w]) {
        que.push(w);
      }
    }
  }
  for (int v : vs) {
    for (const auto& e : g[v]) {
      dp[e.to] = min({dp[e.to], dp[v] + e.cost, dist[v], dist[e.to]});
    }
  }
  return {dist, dp};
}

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int n, m; cin >> n >> m;
  VV<Edge> g(n);
  while (m--) {
    int a, b, c; cin >> a >> b >> c, --a, --b;
    g[a].emplace_back(Edge{b, c});
    g[b].emplace_back(Edge{a, c});
  }
  auto p = dijkstra<lint>(g);
  for (int i = 0; i < n; ++i) {
    cout << p.first[i] + p.second[i] << '\n';
  }
}