from collections import defaultdict, deque

n = int(input())
m = int(input())
G = defaultdict(list)
INcnt = [0 for _ in range(n)]
OUTs = defaultdict(list)
for _ in range(m):
    p, q, r = map(int, input().split())
    G[r - 1].append((p - 1, q))
    OUTs[p - 1].append(r - 1)
    INcnt[r - 1] += 1

Topo = []
Que = deque([i for i in range(n) if INcnt[i] == 0])
while Que:
    u = Que.popleft()
    Topo.append(u)
    for v in OUTs[u]:
        INcnt[v] -= 1
        if INcnt[v] == 0:
            Que.append(v)

Topo.reverse()
ANS = [0 for _ in range(n)]
ANS[n - 1] = 1
for cp in Topo:
    for np, q in G[cp]:
        ANS[np] += q * ANS[cp]
    if G[cp]:
        ANS[cp] = 0
print(*ANS[:-1], sep='\n')