#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
int n;
int q;
using P = pair<int,int>;
vector<vector<P>> G;

void solve(){
	vector<int> tropical;
	{
		vector<int> jisu(n);
		for(int i = 0;i<n;i++){
			for(auto &[to,cost]:G[i]){
				jisu[to]++;
			}
		}
		queue<int> Q;
		for(int i = 0;i<n;i++){
			if(jisu[i]==0){
				Q.push(i);
			}
		}
		while(Q.size()){
			int idx = Q.front();
			tropical.push_back(idx);
			Q.pop();
			for(auto &[to,cost]:G[idx]){
				jisu[to]--;
				if(jisu[to]==0){
					Q.push(to);
				}
			}
		}
	}
	vector<unsigned long long> ans(n);
	ans[n-1] = 1;
	for(auto &i:tropical){
		for(auto &[to,cost]:G[i]){
			ans[to] += ans[i]*cost;
		}
		if(G[i].size()){
			ans[i] = 0;
		}
	}
	for(int i = 0;i<n-1;i++){
		cout<<ans[i]<<endl;
	}
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n >> q;
	G = vector<vector<P>>(n);
	for(int i = 0;i<q;i++){
		int a,b,c;
		cin >> a >> b >> c;
		a--;
		c--;
		G[c].push_back(P(a,b));
	}
	solve();
}