import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

n,m=MI()
to=[[] for _ in range(n)]

for _ in range(m):
    u,v=MI1()
    c=II()
    to[u].append((v,c))
    to[v].append((u,c))

def ng(u):
    for v,c in to[u]:
        if xx[v]==-1:
            xx[v]=xx[u]^c
            if ng(v):return True
        elif xx[u]^c!=xx[v]:
            return True
    return False

xx=[-1]*n
for u in range(n):
    if xx[u]!=-1:continue
    xx[u]=0
    if ng(u):
        print(-1)
        exit()

if max(xx)>1<<30:
    print(-1)
else:
    print(*xx,sep="\n")