#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, int> P;

int n, m;
int ans[100];
bool par[100];
vector<P> g[100];

ll dfs(int cur) {
	if (ans[cur] != 0) return ans[cur];
	ll res = 0;
	for (P p : g[cur]) {
		res += dfs(p.second) * p.first;
	}
	ans[cur] = res;
	return res;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cin >> n >> m;	
	for (int i = 0; i < m; i++) {
		int p, r;
		ll q;
		cin >> p >> q >> r;
		p--;
		r--;
		g[p].emplace_back(q, r);
		par[r] = true;
	}
	
	ans[n - 1] = 1;
	for (int i = 0; i < n - 1; i++) {
		if (par[i]) cout << 0 << endl;
		else cout << dfs(i) << endl;
	}
	return 0;
}