#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <ctime>
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FFOR(i,a,b) for(int i=(a);i<=(b);i++)
#define REP(i,b) FOR(i,0,b)
#define RREP(i,b) FFOR(i,1,b)
#define PB push_back
#define F first
#define S second
#define BE(c) c.begin(),c.end()
using namespace std;
typedef long long LL;
typedef LL ut;
typedef long double ld;
typedef pair<ut,ut> pr;
typedef vector<pr> Vpr;
typedef vector<ut> VI;
typedef pair<ut,pr> ppr;
typedef priority_queue<pr,Vpr, greater<pr> > PQ;
const int SIZE=1e+5 + 1;
const ut INF=1<<29;
const ld eps=1e-6;
const LL mod=1e+6 + 3;

vector<pr> G[128];

int main() {
	int N, M;
	cin >> N >> M;
	REP(i,M){
		int p, q, r;
		scanf("%d%d%d", &p, &q, &r);
		G[r].PB(pr(p, q));
	}
	int ans[128] = {0};
	queue<pr> que;
	que.push(pr(N, 0));
	while(!que.empty()){
		pr p = que.front(); que.pop();
		if(G[p.F].empty()){
			ans[p.F] += p.S;
			continue;
		}
		REP(i,G[p.F].size()){
			pr v = G[p.F][i];
			que.push(pr(v.F, (p.S ? p.S : 1) * v.S));
		}
	}
	FOR(i,1,N){
		cout << ans[i] << endl;
	}
 	return 0;
}