#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
vector<P> v[100];
bool used[100];
ll out[100][100];
int n, m;
void dfs(int id) {
	used[id] = true;
	int len = v[id].size();
	if (len == 0) {
		out[id][id] = 1; return;
	}
	rep(i, len) {
		int nex = v[id][i].first;
		if (!used[nex])dfs(nex);
		rep(j, n) {
			out[id][j] += out[nex][j] * v[id][i].second;
		}
	}
}
int main() {
	cin >> n >> m;
	rep(i, m) {
		int p, q, r; cin >> p >> q >> r; p--; r--;
		v[r].push_back({ p,q });
	}
	dfs(n-1);
	rep(i, n - 1) {
		cout << out[n - 1][i] << endl;
	}
	//stop
	return 0;
}