import Queue

n = int(raw_input())
m = int(raw_input())
INF = -1
table = [[INF for _ in xrange(n + 1)] for _ in xrange(n + 1)]
for _ in xrange(m):
    p, q, r = map(int, raw_input().split())
    table[p][r] = q

buy = [0] * (n + 1)
queue = Queue.deque()
queue.append((n, 1))
while len(queue) > 0:
    current, cost = queue.pop()
    hit = False
    for i in xrange(n + 1):
        if table[i][current] != INF:
            queue.append((i, table[i][current] * cost))
            hit = True
    if not hit:
        buy[current] += cost

for i in xrange(1, n):
    print buy[i]