#include<bits/stdc++.h>
using namespace std;
#define int long long int

int32_t main() {
  ios::sync_with_stdio(false);cin.tie(nullptr);
  int n, m;
  cin >> n >> m;
  vector<vector<pair<int, int>>>routes(n+1);
  for(int i = 0; i < m; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    routes[a].push_back({c, b});
  }
  set<pair<int, int>>queu;
  vector<bool>visited(n+1, 0);
  vector<int>dist(n+1, 1e18);
  queu.insert({0, 1});
  while(!queu.empty()) {
    int root = (*queu.begin()).second;
    int curdist = (*queu.begin()).first;
    queu.erase(queu.begin());
    if(visited[root]) continue;
    visited[root] = true;
    dist[root] = min(dist[root], curdist);
    for(int i = 0; i < routes[root].size(); i++) {
      if(visited[routes[root][i].second]) continue;
      queu.insert({curdist+routes[root][i].first, routes[root][i].second});
    }
  }
  for(int i = 1; i <= n; i++) {
    cout << dist[i] << " ";
  }
  return 0;
}