#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

template <class S>
struct potentialized_dsu {
  public:
    potentialized_dsu() : _n(0) {}
    potentialized_dsu(int n) : _n(n), parent_or_size(n, -1), d(n) {}

    int merge(int a, int b, S v) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
		
		if (-parent_or_size[x] < -parent_or_size[y]){
			std::swap(x, y);
			std::swap(a, b);
		}
		
		v += diff(x,a);
		v -= diff(y,b);
		
		d[y] += d[x] + v;
		
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
		
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
		int l = leader(parent_or_size[a]);
		if(parent_or_size[a] != l){
			d[a] += d[parent_or_size[a]];
			parent_or_size[a] = l;
		}
        return parent_or_size[a];
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }
	
	S diff(int a,int b){
		assert(0 <= a && a < _n);
		assert(0 <= b && b < _n);
		leader(a);
		leader(b);
		return d[b] - d[a];
	}

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

  private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
	std::vector<S> d;
};

struct xorint{
	int v = 0;
	xorint operator+(xorint another)const{
		return (xorint(*this)+=another);
	}
	
	xorint &operator+=(const xorint &another){
		(*this).v ^= another.v;
		return (*this);
	}
	
	xorint operator-(xorint another)const{
		return (xorint(*this)+=another);
	}
	
	xorint &operator-=(const xorint &another){
		(*this).v ^= another.v;
		return (*this);
	}
};

int main(){
	
	int n,m;
	cin>>n>>m;
	
	vector<int> a(m),b(m),y(m);
	rep(i,m){
		cin>>a[i]>>b[i]>>y[i];
		a[i]--;b[i]--;
	}
	
	potentialized_dsu<xorint> D(n);
	
	rep(i,m){
		xorint t;
		t.v = y[i];
		if(D.same(a[i],b[i])){
			if(D.diff(a[i],b[i]).v!=t.v){
				cout<<-1<<endl;
				return 0;
			}
		}
		else{
			D.merge(a[i],b[i],t);
		}
	}
	
	
	vector<int> ans(n);
	rep(i,n){
		ans[i] = D.diff(0,i).v;
	}
	
	rep(i,n){
		cout<<ans[i]<<endl;
	}
	
    return 0;
}