#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
#include <fstream>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
using namespace std;


#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>

vector<P> g[110000];
vector<ll> ans(110000), in(110000);
int main() {
	ll n, m;
	cin >> n >> m;
	REP(i, m) {
		ll a, b, c;
		cin >> a >> b >> c;
		a--;
		c--;
		g[c].push_back(P(a, b));
		in[a]++;
	}
	queue<ll> que;
	REP(i, n) if (in[i] == 0)que.push(i);
	ans[n - 1] = 1;
	while (!que.empty()) {
		ll now = que.front();
		ans.push_back(now);
		que.pop();
		REP(i, g[now].size()) {
			ll v = g[now][i].first;
			in[v]--;
			ans[v] += ans[now] * g[now][i].second;
			if (in[v] == 0) que.push(v);
		}
		if (g[now].size())ans[now] = 0;
	}
	REP(i, n - 1)cout << ans[i] << endl;
}