#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>

using namespace std;

int main() {
	int n, m;

	cin >> n >> m;
	vector< vector< pair<int, int>  > > recipe(n + 1, vector< pair<int, int> >());
	vector< set<int> > materials(n + 1, set<int>());
	int p, q, r;
	for (int i = 0; i < m; i++) {
		cin >> p >> q >> r;
		recipe[r].push_back(make_pair(p, q));
		materials[p].insert(r);
	}

	vector<long long> need(n + 1, 0);
	vector<bool> check(n + 1, 0);

	need[n] = 1;
	check[0] = true;
	bool update = true;
	while (update) {
		update = false;
		for (int i = 1; i <= n; i++) {
			if (need[i] > 0 && !check[i] && materials[i].size() == 0) {

				update = true;
				for (int j = 0; j < recipe[i].size(); j++) {
					pair<int, int> tmp = recipe[i][j];
					need[tmp.first] += need[i] * tmp.second;
				}
				if (!recipe[i].empty()) {
					need[i] = 0;
				}
				check[i] = true;
				for (int k = 1; k <= n; k++) {
					materials[k].erase(i);
				}
			}
		}
	}

	for (int i = 1; i < n; i++) {
		cout << need[i] << endl;
	}
	return 0;
}