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

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

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;
const int Nmax = 50'005;
ifstream fin {"dijkstra.in"};
ofstream fout {"dijkstra.out"};

vector<pii> G[Nmax];
char vis[Nmax];
int d[Nmax];

int main(void) {
  // freopen("dijkstra.in", "r", stdin);
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  int N, M, a, b, c;
  fin >> N >> M;
  rep(i, N) {
    d[i] = INF;
    vis[i] = 0;
  }

  rep(i, M) {
    fin >> a >> b >> c;
    --a; --b;
    G[a].push_back({b, c});
    G[b].push_back({a, c});
  }
  priority_queue<pii, vector<pii>, greater<pii> > Q;
  Q.push({0,0});
  pii X;
  int dist, nod;
  while(!Q.empty()) {
    X = Q.top(); Q.pop();
    tie(dist, nod) = X;
    if (vis[nod])
      continue;

    vis[nod] = 1;
    d[nod] = dist;
    int nbr_nod, nbr_cost;
    for(auto Y: G[nod]) {
      tie(nbr_nod, nbr_cost) = Y;
      if (vis[nbr_nod])
        continue;
      if (d[nbr_nod] > dist + nbr_cost) {
        d[nbr_nod] = dist + nbr_cost;
        Q.push({d[nbr_nod], nbr_nod});
      }
    }
  }

  for(int i = 1; i< N; i++)
    fout << (d[i] == INF ? 0 : d[i]) << " ";
  fout << "\n";

  return 0;
}