N = int(input())
M = int(input())
G = [[] for _ in range(N+1)]
rG = [[] for _ in range(N+1)]
Gnum = [0] * (N + 1)
for _ in range(M):
    p,q,r = map(int,input().split())
    G[p].append(r)
    rG[r].append((p,q))
    Gnum[r] += 1
top = []
gaibu = set()
from collections import deque
q = deque()
for i in range(1,N+1):
    if Gnum[i] == 0:
        q.append(i)
        gaibu.add(i)
while q:
    now = q.popleft()
    top.append(now)
    for v in G[now]:
        Gnum[v] -= 1
        if Gnum[v] == 0:
            q.append(v)
dp = [0] * (N+1)
dp[N] = 1
for now in reversed(top):
    for v,c in rG[now]:
        dp[v] += dp[now] * c
for i in range(1,N):
    if i in gaibu:
        print(dp[i])
    else:
        print(0)