from sys import setrecursionlimit, stdin
from collections import deque


def find(parent, i):
    t = parent[i]
    if t < 0:
        return i
    t = find(parent, t)
    parent[i] = t
    return t


def unite(parent, i, j):
    i = find(parent, i)
    j = find(parent, j)
    if i == j:
        return
    parent[j] += parent[i]
    parent[i] = j


readline = stdin.readline
setrecursionlimit(10 ** 6)

N, M = map(int, readline().split())

parent = [-1] * N
d = {}
for _ in range(M):
    A, B = map(lambda x: int(x) - 1, readline().split())
    Y = int(readline())
    if A in d and B in d[A]:
        if d[A][B] != Y:
            print(-1)
            exit()
    d.setdefault(A, {})
    d.setdefault(B, {})
    d[A][B] = Y
    d[B][A] = Y
    unite(parent, A, B)

result = [-1] * N
q = deque(i for i in range(N) if parent[i] < 0)
for i in q:
    result[i] = 0
while q:
    a = q.popleft()
    for b in d[a]:
        if result[b] != -1:
            continue
        result[b] = result[a] ^ d[a][b]
        q.append(b)
print(*result, sep='\n')