#include <fstream>
#include <vector>
#include <set>
#define to first
#define cost second

using namespace std;

ifstream cin ("dijkstra.in");
ofstream cout ("dijkstra.out");

const int NMAX = 50000;
const int INF = 1000000000;
typedef pair <int, int> Edge;

int n, m;
int x, y, c;

int sol[1 + NMAX];
vector <Edge> g[1 + NMAX];
set <Edge> mySet;

int main() {
  cin >> n >> m;
  for(int i = 1; i <= m; i++) {
    cin >> x >> y >> c;
    g[x].push_back({y, c});
    sol[i] = INF;
  }
  mySet.insert({1, 0});
  sol[1] = 0;
  while(!mySet.empty()) {
    Edge top = *(mySet.begin());
    mySet.erase(mySet.begin());
    for(int i = 0; i < g[top.to].size(); i++) {
      Edge nod = g[top.to][i];
      if(sol[nod.to] > sol[top.to] + nod.cost) {
        if(sol[nod.to] != INF)
          mySet.erase(mySet.find({nod.to, sol[nod.to]}));
        sol[nod.to] = sol[top.to] + nod.cost;
        mySet.insert({nod.to, sol[nod.to]});
      }
    }
  }
  for(int i = 2; i <= n; i++) {
    if(sol[i] != INF)
      cout << sol[i] << " ";
    else
      cout << "0 ";
  }
  return 0;
}