from collections import deque
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)

N = int(input())
M = int(input())
out = [0] * N
parent = [[] for _ in range(N)]
for _ in range(M):
    s, c, t = map(int, input().split())
    s -= 1
    t -= 1
    out[s] += 1
    parent[t].append((s, c))


cnt = [0] * N
que = deque()
for i, o in enumerate(out):
    if not o:
        cnt[i] = 1
        que.append(i)

while que:
    s = que.popleft()
    d = cnt[s]
    for t, c in parent[s]:
        cnt[t] += c * d
        out[t] -= 1
        if out[t] == 0:
            que.append(t)
    if parent[s]:
        cnt[s] = 0

print(*cnt[:-1], sep="\n")