#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

const int MAX_N = 100010;

struct Edge {
  int to;
  ll cost;

  Edge(int to = -1, ll cost = -1) {
    this->to = to;
    this->cost = cost;
  }
};

struct Node {
  int v;
  ll cost;
  bool use_ticket;

  Node(int v = -1, ll cost = -1, bool use_ticket = false) {
    this->v = v;
    this->cost = cost;
    this->use_ticket = use_ticket;
  }

  bool operator>(const Node &n) const {
    return cost > n.cost;
  }
};

vector<Edge> E[MAX_N];

int main() {
  int N, M;
  cin >> N >> M;
  int a, b, c;
  for (int i = 0; i < M; ++i) {
    cin >> a >> b >> c;

    E[a].push_back(Edge(b, c));
    E[b].push_back(Edge(a, c));
  }

  priority_queue <Node, vector<Node>, greater<Node>> pque;
  pque.push(Node(1, 0));
  ll costs[N + 1][2];
  memset(costs, 0, sizeof(costs));
  bool visited[N + 1][2];
  memset(visited, false, sizeof(visited));
  costs[1][1] = 0;
  visited[1][1] = true;

  while (not pque.empty()) {
    Node node = pque.top();
    pque.pop();

    if (visited[node.v][node.use_ticket]) continue;
    visited[node.v][node.use_ticket] = true;
    costs[node.v][node.use_ticket] = node.cost;

    for (auto &[u, cost] : E[node.v]) {
      pque.push(Node(u, node.cost + cost, node.use_ticket));

      if (not node.use_ticket) {
        pque.push(Node(u, node.cost, true));
      }
    }
  }

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

  return 0;
}