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