// Dijkstra: Priority Queue

#include <stdio.h>
#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < n; i++)
#define Rep(i,a,b) for(int i = a; i < b; i++)

#define _vertex second
#define _cost first

using namespace std;
typedef pair<int, int> pii;
const int INF = 0x3f3f3f3f;
const int Nmax = 50333;

vector<pii> G[Nmax];
int N, M, a, b, c, d[Nmax];
char vis[Nmax];

int main(void) {
  freopen("dijkstra.in", "r", stdin);
  freopen("dijkstra.out", "w", stdout);

  cin >> N >> M;
  rep(i, M) {
    cin >> a >> b >> c;
    --a;
    --b;
    G[a].push_back({c, b}); // {cost, neighbor }
  }
  rep(i, N) { d[i] = INF; }
  priority_queue<pii, vector<pii>, greater<pii> > Q; // order ascending

  d[0] = 0; vis[0] = 1;
  for(pii V: G[0]) {
    Q.push({V._cost, V._vertex}); // ascending by cost - P.second
  }

  while(!Q.empty()) {
    pii V = Q.top(); Q.pop();
    if(vis[V._vertex])
      continue;

    d[V._vertex] = V._cost;
    vis[V._vertex] = 1;

    for(pii X: G[V._vertex]) {
      if (d[X._vertex] > d[V._vertex] + X._cost) {
        d[X._vertex] = d[V._vertex] + X._cost;
        Q.push({ d[X._vertex], X._vertex });
      }
    }
  }

  Rep(i, 1, N) {
    cout << (d[i] == INF ? 0 : d[i]) << ' ';
  }
  cout << endl;

  return 0;
}