#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"

template<class Abel> struct UnionFind {
	vector<int> par;
	vector<int> rank;
	vector<Abel> diff_weight;

	UnionFind(int n = 1, Abel SUM_UNITY = 0) { init(n, SUM_UNITY); }

	void init(int n = 1, Abel SUM_UNITY = 0) {
		par.resize(n); rank.resize(n); diff_weight.resize(n);
		for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
	}

	int root(int x) {
		if (par[x] == x) { return x; }
		int r = root(par[x]);
		diff_weight[x] ^= diff_weight[par[x]];//★編集★
		par[x] = r;
		return r;
	}

	Abel weight(int x) {
		root(x);
		return diff_weight[x];
	}

	bool issame(int x, int y) {
		return root(x) == root(y);
	}

	bool merge(int x, int y, Abel w) {
		int rx = root(x);
		int ry = root(y);
		if (rx == ry) {
			if (w != (weight(x) ^ weight(y))) {
				return false;
			}
			return true;
		}
		par[ry] = x;
		diff_weight[ry] = w ^ diff_weight[y];
		return true;
	}

	Abel diff(int x, int y) {
		return weight(y) ^ weight(x);//★編集★
	}
};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N, M;
	cin >> N >> M;
	UnionFind<int> uf(N);
	rep(i, N) {
		int a, b, y;
		cin >> a >> b >> y;
		a--;
		b--;
		if (!uf.merge(a, b, y)) {
			cout << -1 << endl;
			return 0;
		}
	}
	rep(i, N) {
		cout << uf.diff_weight[i] << endl;
	}
	return 0;
}