#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int N, M;
vector<pair<int, ll>> es[100];
ll res[100];

bool ved[100];
vector<int> tp;

void tsort(int v) {
	if (ved[v]) return;
	ved[v] = true;
	REP(i, es[v].size()) tsort(es[v][i].first);
	tp.push_back(v);
}

int main(int argc, char **argv) {
	cin >> N >> M;
	REP(i, M) {
		int P, Q, R;
		cin >> P >> Q >> R;
		--P; --R;
		es[R].push_back(MP(P, Q));
	}
	CLEAR(ved);
	tsort(N - 1);
	reverse(ALL(tp));
	CLEAR(res);
	res[N - 1] = 1;
	REP(i, tp.size()) {
		int v = tp[i];
		if (es[v].size() == 0) continue;
		REP(j, es[v].size()) res[es[v][j].first] += res[v] * es[v][j].second;
		res[v] = 0;
	}
	REP(i, N - 1) cout << res[i] << endl;
	return 0;
}