N = int(input())
M = int(input())
E = [[] for _ in range(N)]
D = [0] * N
dp = [0] * N
dp[N - 1] = 1
for i in range(M):
    p,r,q = map(int,input().split())
    p -= 1
    q -= 1
    E[q].append((p,r))
    D[p] += 1

Q = [N-1]
while Q:
    x = Q.pop()
    for y,r in E[x]:
        D[y] -= 1
        dp[y] += r * dp[x]
        if D[y] == 0:
            Q.append(y)

for i in range(N-1):
    if len(E[i]) == 0:
        print(dp[i])
    else:
        print(0)