#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 dp(N, vector(N, longINF));
	REP(i, M) {
		int u, v;
		ll d;
		scanf("%d %d %lld", &u, &v, &d);
		chmin(dp[u - 1][v - 1], d);
	}
	REP(i, N) dp[i][i] = 0;
	REP(k, N) REP(i, N) REP(j, N) if (dp[i][k] != longINF && dp[k][j] != longINF) chmin(dp[i][j], dp[i][k] + dp[k][j]);
	REP(i, N) {
		ll ans = 0;
		REP(j, N) ans += dp[i][j] == longINF ? 0 : dp[i][j];
		cout << ans << endl;
	}
}