#include<cstdio>
#include<vector>


using namespace std;
using ui=unsigned int;


struct edge_t
{
	int cost, to;
};


struct node_t
{
	ui rest;
	vector<edge_t> edge;
};


int main(void)
{
	vector<node_t> node;
	int n, m, i, is_changed;

	while(scanf("%d%d", &n, &m)==2)
	{
		node.clear();
		node.resize(n+1);

		for(i=0;i<m;i++)
		{
			int p, q, r;
			scanf("%d%d%d", &p, &q, &r);
			node[r].edge.push_back((edge_t){q, p});
		}

		node[n].rest=1;
		do
		{
			is_changed=0;
			for(i=1;i<=n;i++)
			{
				if(node[i].rest==0) continue;
				if(node[i].edge.size()==0) continue;

				is_changed=1;
				for(auto e: node[i].edge)
				{
					node[e.to].rest+=node[i].rest*e.cost;
				}
				node[i].rest=0;
			}
		}
		while(is_changed);

		for(i=1;i<n;i++)
		{
			printf("%u\n", node[i].rest);
		}
	}

	return 0;
}