# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = std::numeric_limits<long long>::max();
const double PI = acos(-1);
#define fir first
#define sec second
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Mfor(i,mf) for(LL i=mf-1;i>=0;i--)
LL h, w, n, m, k, s, t, q, sum, last, cnt, ans,d[1000];
struct Edge { LL to, cost; };
string str;
bool ff[1000][1000];
vector<Edge>vec[1000],fvec[1000];
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
int main() {
	cin >> n >> m;
	rep(i, m) {
		LL x, y, z;
		cin >> x >> y >> z;
		vec[z].push_back(Edge{ x,y });
		fvec[x].push_back(Edge{ z,y });
	}
	deque<LL>q;
	q.push_back(n);
	d[n] = 1;
	while (!q.empty()) {
		LL v = q.front();
		q.pop_front();
		bool FF = 0;
		rep(i, fvec[v].size()) {
			if (!ff[v][fvec[v][i].to]) {
				FF = 1; break;
			}
		}
		if (FF)continue; 
		rep(i, vec[v].size()) {
			if (!ff[v][vec[v][i].to]) {
				d[vec[v][i].to] += d[v] * vec[v][i].cost;
				ff[v][vec[v][i].to] = 1;
				ff[vec[v][i].to][v] = 1;
				q.push_back(vec[v][i].to);
			}
		}
	}
	rep(i, n-1) {
		if (vec[i + 1].size() == 0)
			cout << d[i + 1] << endl;
		else cout << 0 << endl;
	}
	return 0;
}