import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
from collections import Counter, deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import degrees, gcd as GCD, modf
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

N=int(readline())
M=int(readline())
graph=[[] for i in range(N)]
degree=[0]*N
for _ in range(M):
    P,Q,R=map(int,readline().split())
    P-=1;R-=1
    graph[R].append((P,Q))
    degree[P]+=1
queue=deque([x for x in range(N) if degree[x]==0])
ans_lst=[0]*N
ans_lst[N-1]=1
while queue:
    x=queue.pop()
    for y,q in graph[x]:
        ans_lst[y]+=ans_lst[x]*q
        degree[y]-=1
        if degree[y]==0:
            queue.append(y)
for x in range(N):
    if graph[x]:
        ans_lst[x]=0
for ans in ans_lst[:-1]:
    print(ans)