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

from collections import deque


def solve(N, edges, k):
    next_nodes  =[[] for _ in range(N)]
    for i, j, y  in edges:
        y0 = 1 if (y & (1 << k) > 0) else 0
        next_nodes[i].append((j, y0))
        next_nodes[j].append((i, y0))

    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]:
                    if values[w] == -1:
                        values[w] = y ^ values[v]
                        queue.append(w)
                    elif values[w] != y ^ values[v]:
                        return -1

    for i in range(N):
        if values[i] == -1:
            values[i] = 0
    return values



def main():
    N, M = map(int, input().split())
    edges = []
    for _ in range(M):
        a, b = map(int, input().split())
        y = int(input())
        edges.append((a - 1, b - 1, y))
    
    answers = [0] * N
    for k in range(30):
        ans = solve(N, edges, k)
        if ans == -1:
            print(-1)
            return
        
        for i in range(N):
            answers[i] += (1 << k) * ans[i]
    
    for i in range(N):
        print(answers[i])



if __name__ == "__main__":
    main()