#include <bits/stdc++.h>

using namespace std;

#define oo 0x3f3f3f3f
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n, m;
int d[50005];
vector<pair<int, int>> graph[50005];

void read() {
  f>>n>>m;
  int x, y, z;
  for(int i = 1;i <= n;++i) {
    f>>x>>y>>z;
    graph[x].push_back(make_pair(y, z));
  }
}

void solve() {
  memset(d, oo, sizeof(d));
  d[1] = 0;
  set<pair<int, int>> s;
  s.insert(make_pair(0, 1));

  while(!s.empty()) {
    auto node = s.begin()->second;
    s.erase(s.begin());
    
    for(const auto& edge : graph[node]) {
      if(d[edge.first] < d[node] + edge.second) {
        continue;
      }
      if(d[edge.first] != oo) {
        s.erase(s.find(make_pair(d[edge.first], edge.first)));
      }
      d[edge.first] = d[node] + edge.second;
      s.insert(make_pair(d[edge.first], edge.first));
    }
  }

  for(int i = 2;i <= n;++i) {
    g<<(d[i] == oo ? 0 : d[i])<<" ";
  }
}

int main() {
  
  read();
  solve();

  return 0;
}