def cmb(n, r, mod):#コンビネーションの高速計算　
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return (g1[n] * g2[r] % mod) * g2[n-r] % mod

mod = 998244353#出力の制限
N = 2*10**3
g1 = [1]*(N+1) # 元テーブル
g2 = [1]*(N+1) #逆元テーブル
inverse = [1]*(N+1) #逆元テーブル計算用テーブル

for i in range( 2, N + 1 ):
    g1[i]=( ( g1[i-1] * i ) % mod )
    inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0

import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N,M = mi()
edge = [[] for i in range(N)]
for _ in range(M):
    a,b = mi()
    y = int(input())
    edge[a-1].append((b-1,y))
    edge[b-1].append((a-1,y))

X = [0 for i in range(N)]
val = [False]*N

for i in range(N):
    if not val[i]:
        val[i] = True
        stack = [i]
        while stack:
            v = stack.pop()
            for nv,x in edge[v]:
                if val[nv]:
                    if X[v]^X[nv]!=x:
                        exit(print(-1))
                else:
                    val[nv] = True
                    X[nv] = X[v]^x
                    stack.append(nv)

print(*X,sep="\n")