/* -*- coding: utf-8 -*-
 *
 * 1344.cc:  No.1344 Typical Shortest Path Sum - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100;
const long long LINF = 1LL << 62;

/* typedef */

typedef long long ll;

/* global variables */

ll ms[MAX_N][MAX_N];

/* subroutines */

inline void setmin(ll &a, ll b) { if (a > b) a = b; }

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      ms[i][j] = (i == j) ? 0 : LINF;
  
  for (int i = 0; i < m; i++) {
    int u, v;
    ll d;
    scanf("%d%d%lld", &u, &v, &d);
    u--, v--;
    setmin(ms[u][v], d);
  }

  for (int k = 0; k < n; k++)
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++)
	if (ms[i][k] < LINF && ms[k][j] < LINF)
	  setmin(ms[i][j], ms[i][k] + ms[k][j]);

  for (int i = 0; i < n; i++) {
    ll sum = 0;
    for (int j = 0; j < n; j++)
      if (ms[i][j] < LINF) sum += ms[i][j];
    printf("%lld\n", sum);
  }
  return 0;
}