#include <iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
#include<random>
#include<complex>
#include<math.h>
#include<functional>
#include<stack>
#include<queue>
#include<unordered_map>
#include<set>
#include<numeric>
#include <cassert>
using namespace std;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
#define req(i,n) for(int i = 1;i <=  n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int inf = 0x3fffffff;
const ll INF = 1e18;
int main() {
	int n, m; ll sum = 0; cin >> n >> m;
	vector<vector<ll>> d(n, vector<ll>(n, 1e18));
	rep(i, n) d[i][i] = 0;
	rep(i, m) {
		ll a, b, c; cin >> a >> b >> c;
		chmin(d[--a][--b],c);
	}rep(i, n) rep(j, n) rep(k, n) chmin(d[j][k], d[j][i] + d[i][k]);
	rep(i, n) {
		sum = 0;
		rep(j, n) {
			if (d[i][j] < 1e13) sum += d[i][j];
		}cout << sum << endl;
	}
}