#include <iostream>
#include <cstdio>
#include <vector>
#include <utility>
using namespace std;
 
vector<vector<int> > g, gw;
vector<long long> memo;
 
long long rec(int i) {
	long long &r = memo[i];
	if(r != -1) return r;
	if(i == (int)g.size() - 1)
		return r = 1;
	r = 0;
	for(int j = 0; j < (int)g[i].size(); ++ j)
		r += rec(g[i][j]) * gw[i][j];
	return r;
}
 
int main() {
	int N, M;
	while(~scanf("%d%d", &N, &M)) {
		g.assign(N, vector<int>());
		gw.assign(N, vector<int>());
		vector<bool> producable(N, false);
		for(int i = 0; i < M; ++ i) {
			int P, Q, R;
			scanf("%d%d%d", &P, &Q, &R), -- P, -- R;
			g[P].push_back(R);
			gw[P].push_back(Q);
			producable[R] = true;
		}
		memo.assign(N, -1);
		for(int i = 0; i < N-1; ++ i)
			printf("%lld\n", producable[i] ? 0 : rec(i));
	}
	return 0;
}