"""

桁ごとに求められる
1箇所決め打てば、後は連鎖的に決まる
桁ごとにdfsして、矛盾なければおk

"""

import sys
from sys import stdin
from collections import deque  

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

lis = [ [] for i in range(N) ]

for i in range(M):

    A,B = map(int,stdin.readline().split())
    A -= 1
    B -= 1

    Y = int(stdin.readline())

    lis[A].append((B,Y))
    lis[B].append((A,Y))

ans = [0] * N

for dig in range(30):

    nd = 2**dig
    able = [True] * N

    for st in range(N):

        if able[st]:

            q = deque([st])
            able[st] = False

            while q:
                v = q.popleft()

                for nex,Y in lis[v]:
                    if able[nex]:
                        able[nex] = False
                        ans[nex] |= (Y ^ ans[v]) & nd
                        q.append(nex)
                    elif ans[nex] & nd != (Y ^ ans[v]) & nd:
                        print (-1)
                        sys.exit()

print ("\n".join(map(str,ans)))