from collections import deque
N = int(input())
M = int(input())
cnt = [0] * 101
flag = [False] * 101
Items = [(i, [], []) for i in range(N + 1)]
hyou = [[0] * 101 for _ in range(101)]
cnt[N] = 1
for n in range(M):
    P, Q, R = map(int, input().split())
    flag[R] = True
    Items[P][1].append(R)
    Items[R][2].append(P)
    hyou[P][R] = Q
q = deque()
q.append(N)
while len(q) > 0:
    j = q.popleft()
    p = Items[j]
    if cnt[p[0]] == 0 or flag[p[0]] == False:
        continue
    for k in p[2]:
        cnt[k] += hyou[k][p[0]] * cnt[p[0]]
        q.append(k)
    cnt[p[0]] = 0
for i in range(1, N):
    print(cnt[i])