#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M;
	cin >> N >> M;
	vector<vector<pair<int, ll>>> g(N);
	
	vector A(N, vector<ll>(N, longINF));
	REP(i, M) {
		int s, t;
		ll d;
		scanf("%d %d %lld", &s, &t, &d);
		chmin(A[s - 1][t - 1], d);
	}
	REP(i, N) REP(j, N) if (A[i][j] != longINF) g[i].emplace_back(j, A[i][j]);
	
	REP(i, N) {
		vector<ll> dist(N, longINF);
		using P = pair<ll, int>;
		priority_queue<P, vector<P>, greater<P>> pq;
		pq.emplace(0, i);
		dist[i] = 0;
		
		while (!pq.empty()) {
			auto [curd, u] = pq.top(); pq.pop();
			if (dist[u] < curd) continue;
			for (auto [v, d] : g[u]) if (chmin(dist[v], curd + d)) pq.emplace(curd + d, v);
		}
		
		ll ans = 0;
		REP(j, N) if (i != j) ans += dist[j] == longINF ? 0 : dist[j];
		cout << ans << endl;
	}
}