## https://yukicoder.me/problems/no/1420

from collections import deque


def solve(N, next_nodes, k):

    queue = deque()    
    values = [-1] * N
    for s_i in range(N):
        if values[s_i] == -1:
            values[s_i] = 0
            queue.append(s_i)
            while len(queue) > 0:
                v = queue.popleft()
                for w, y in next_nodes[v]:
                    y0 = 1 if (1 << k) & y > 0 else 0
                    x = y0 ^ values[v]
                    if values[w] == -1:
                        values[w] = x
                        queue.append(w)
                    elif values[w] != x:
                        return -1

    return values



def main():
    N, M = map(int, input().split())
    next_nodes  =[[] for _ in range(N)]
    for _ in range(M):
        a, b = map(int, input().split())
        y = int(input())
        next_nodes[a - 1].append((b - 1, y))
        next_nodes[b - 1].append((a - 1, y))
    


    answers = [0] * N
    for k in range(30):
        ans = solve(N, next_nodes, k)
        if ans == -1:
            print(-1)
            return
        
        for i in range(N):
            if ans[i] != -1:
                answers[i] += (1 << k) * ans[i]
    
    for i in range(N):
        print(answers[i])



if __name__ == "__main__":
    main()