#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 = 50005;
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(make_pair(y, c));
  }
  for(int i = 1; i <= n; i++)
    sol[i] = INF;
  mySet.insert({1, 0});
  sol[1] = 0;
  while(!mySet.empty()) {
    int top = mySet.begin()->to;
    mySet.erase(mySet.begin());
    for(int i = 0; i < g[top].size(); i++) {
      int nod = g[top][i].to, cost1 = g[top][i].cost;
      if(sol[nod] > sol[top] + cost1) {
        if(sol[nod] != INF && mySet.find(make_pair(nod, sol[nod])) != mySet.end())
          mySet.erase(mySet.find(make_pair(nod, sol[nod])));
        sol[nod] = sol[top] + cost1;
        mySet.insert(make_pair(nod, sol[nod]));
      }
    }
  }
  for(int i = 2; i <= n; i++) {
    if(sol[i] != INF)
      cout << sol[i] << " ";
    else
      cout << "0 ";
  }
  return 0;
}