from collections import defaultdict, deque


def topological_sort(N, edges):
    outs = defaultdict(list)
    ins = defaultdict(int)
    for v1, v2 in edges:
        outs[v1].append(v2)
        ins[v2] += 1

    q = deque(v1 for v1 in range(N) if ins[v1] == 0)
    while q:
        v1 = q.popleft()
        yield v1
        for v2 in outs[v1]:
            ins[v2] -= 1
            if ins[v2] == 0:
                q.append(v2)


N = int(input())
M = int(input())
edges = []
material = [[] for _ in range(N)]
for _ in range(M):
    p, q, r = map(int, input().split())
    p -= 1
    r -= 1
    edges.append((p, r))
    material[r].append((p, q))

ans = [0] * N
ans[N - 1] = 1
for x in reversed(list(topological_sort(N, edges))):
    for p, q in material[x]:
        ans[p] += q * ans[x]
    if material[x]:
        ans[x] = 0
print(*ans[:-1], sep='\n')