n,m=map(int,input().split())

par=[-1] * n
diff=[0] * n
def find(x):
        if par[x]<0:
                return x
        r=find(par[x])
        diff[x]^=diff[par[x]]
        par[x]=r
        return r
def weight(x):
        find(x)
        return diff[x]
def diff_query(x,y):
        return weight(x)^weight(y)
def same(x,y):
        return find(x)==find(y)
def unite(x,y,w):
        if(same(x,y)):
                if diff_query(x,y)!=w:
                        return False
                else:
                        return True
        w=(w^weight(x))^weight(y)
        x=find(x)
        y=find(y)
        if par[x]>par[y]:
                x,y = y,x
        t=par[x]+par[y]
        par[x]=t
        par[y]=x
        diff[y]=w
        return True


ok=True
for _ in range(m):
        a,b=map(int,input().split())
        y=int(input())
        if unite(a-1,b-1,y)==False:
                ok=False
if ok==False:
        print(-1)
        exit(0)

for i in range(n):
        r=find(i)
        print(diff_query(i,r))