#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef pair<int,int> P;
typedef long long int ll;

void bfs(int now,ll num);
int n,m;
vector<P> data[101];
ll cou[101] = {0};

int main(){
	cin >> n >> m;
	for(int i=0;i<m;i++){
		int a,b,c;
		cin >> a >> b >> c;
		data[c].push_back(P(a,b));
	}
	bfs(n,1);
	for(int i=1;i<n;i++){
		cout << cou[i] << endl;
	}
}

void bfs(int now,ll num){
	int len = data[now].size();
	if(len == 0){
		cou[now] += num;
		return;
	}
	for(int i=0;i<len;i++){
		P p = data[now][i];
		int next = p.first;
		ll nnum = p.second;
		bfs(next,num*nnum);
	}
}