#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

struct Node {
  int u;
  ll cost;

  Node(int u = -1, ll cost = -1) {
    this->u = u;
    this->cost = cost;
  }

  bool operator>(const Node &n) const {
    return cost > n.cost;
  }
};

int main() {
  int N, M;
  cin >> N >> M;

  vector<int> E[N + 1];
  vector<ll> C[N + 1];
  for (int i = 0; i < M; ++i) {
    int s, t;
    ll d;
    cin >> s >> t >> d;

    E[s].push_back(t);
    C[s].push_back(d);
  }

  for (int r = 1; r <= N; ++r) {
    priority_queue <Node, vector<Node>, greater<Node>> pque;
    pque.push(Node(r, 0));

    ll ans = 0;
    vector<bool> visited(N + 1, false);

    while (not pque.empty()) {
      Node node = pque.top();
      pque.pop();

      if (visited[node.u]) continue;
      visited[node.u] = true;
      ans += node.cost;

      for (int i = 0; i < E[node.u].size(); ++i) {
        int t = E[node.u][i];
        ll d = C[node.u][i];

        pque.push(Node(t, node.cost + d));
      }
    }

    cout << ans << endl;
  }

  return 0;
}