#include <bits/stdc++.h>

#define NMAX 50010
#define oo (1 << 30)
#define NO_PARENT (-1)

using namespace std;

class Task {
public:
  void solve() {
    read_input();
    get_result();
    print_output();
  }

private:
  int n, m;
  int source;

  vector<pair<int, int>> adj[NMAX];

  priority_queue<pair<int, int>, vector<pair<int, int>>,
                 std::greater<pair<int, int>>> pq;

  vector<int> d;
  vector<int> p;

  void read_input() {
    fstream fin("dijkstra.in");
    fin >> n >> m;
    d.resize(n + 1);
    p.resize(n + 1);

    source = 1;

    for (int i = 1; i <= m; ++i) {
      int x, y, c;
      fin >> x >> y >> c;
      adj[x].push_back({y, c});
    }
  }

  void get_result() { Dijkstra(source, d, p); }

  void Dijkstra(int source, vector<int> &d, vector<int> &p) {
    for (int i = 1; i <= n; ++i) {
      d[i] = oo;
      p[i] = NO_PARENT;
    }

    p[source] = 0;
    d[source] = 0;

    pq.push({d[source], source});

    while (!pq.empty()) {
      auto entry = pq.top();
      pq.pop();
      int cost = entry.first;
      int node = entry.second;

      if (cost > d[node]) {
        continue;
      }

      for (auto &edge : adj[node]) {
        int neighbour = edge.first;
        int cost_edge = edge.second;

        if (d[node] + cost_edge < d[neighbour]) {
          d[neighbour] = d[node] + cost_edge;
          p[neighbour] = node;
          pq.push({d[neighbour], neighbour});
        }
      }
    }

    for (int i = 1; i <= n; ++i) {
      if (d[i] == oo) {
        d[i] = 0;
      }
    }
  }

  void print_output() {
    ofstream fout("dijkstra.out");
    for (int i = 1; i <= n; ++i) {
      if (i == source) {
        continue;
      }
      cout << d[i] << " ";
    }
    cout << "\n";
  }
};

int main() {
  Task *task = new Task();
  task->solve();
  delete task;

  return 0;
}