import sys
from collections import deque
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N,M = MI()
Graph = [[] for _ in range(N+1)]
for _ in range(M):
    A,B = MI()
    Y = I()
    Graph[A].append((B,Y))
    Graph[B].append((A,Y))

ANS = [-1]*(N+1)
for i in range(1,N+1):
    if ANS[i] != -1:
        continue

    ANS[i] = 0
    deq = deque([i])
    while deq:
        j = deq.pop()
        for k,y in Graph[j]:
            if ANS[k] == -1:
                ANS[k] = ANS[j]^y
                deq.appendleft(k)
            else:
                if ANS[k] != ANS[j]^y:
                    print(-1)
                    exit()

print(*ANS[1:],sep='\n')