import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        UnionFindTree uft = new UnionFindTree(n);
        for (int i = 0; i < m; i++) {
            int a = sc.nextInt() - 1;
            int b = sc.nextInt() - 1;
            int c = sc.nextInt();
            if (uft.same(a, b)) {
                if (uft.get(a, b) != c) {
                    System.out.println(-1);
                    return;
                }
            } else {
                uft.unite(a, b, c);
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < n; i++) {
            sb.append(uft.getCost(i)).append("\n");
        }
        System.out.print(sb);
    }
    
    static class UnionFindTree {
        int[] parents;
        int[] costs;
        
        public UnionFindTree(int size) {
            parents = new int[size];
            costs = new int[size];
            for (int i = 0; i < size; i++) {
                parents[i] = i;
            }
        }
        
        public int find(int x) {
            if (x == parents[x]) {
                return x;
            } else {
                int tmp = find(parents[x]);
                costs[x] ^= costs[parents[x]];
                return parents[x] = tmp;
            }
        }
        
        public int get(int x, int y) {
            find(x);
            find(y);
            return costs[x] ^ costs[y];
        }
        
        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
        
        public int getCost(int x) {
            find(x);
            return costs[x];
        }
        
        public void unite(int x, int y, int c) {
            int xx = find(x);
            int yy = find(y);
            parents[xx] = yy;
            costs[xx] = costs[x] ^ c;
        }
    }
}