//
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define lch (o << 1)
#define rch (o << 1 | 1)

typedef double db;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> pint;
typedef tuple<int, int, int> tint;

const int N = 1e5 + 5;
const int K = 20 + 2;
const int INF = 0x3f3f3f3f;
const ll INF_LL = 0x3f3f3f3f3f3f3f3f;

int dis[N];

struct Adj {
	int v, w;
};
vector<Adj> a[N];
vector<tint> res;

struct DSU {
	int pa[N];
	DSU() {
		for (int i = 1; i < N; i++)
			pa[i] = i;
	}
	int find(int x) {
		return pa[x] == x ? x : pa[x] = find(pa[x]);
	}
	bool isConnected(int u, int v) {
		return find(u) == find(v);
	}
	void merge(int u, int v) {
		int pa1 = find(u);
		int pa2 = find(v);
		pa[pa1] = pa2;
	}
};
DSU dsu;

bool vst[N];
int f[N];

void dfs(int u, int pa) {
	vst[u] = 1;
	for (auto e: a[u]) {
		if (e.v == pa) continue;
		f[e.v] = f[u] ^ e.w;
		dfs(e.v, u);
	}
}

int main() {
	ios::sync_with_stdio(0);

	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		if (dsu.isConnected(u, v)) {
			res.push_back(make_tuple(u, v, w));
		} else {
			a[u].push_back({v, w});
			a[v].push_back({u, w});
			dsu.merge(u, v);
		}
	}

	for (int i = 1; i <= n; i++)
		if (!vst[i])
			dfs(i, 0);

	bool flag = true;
	for (auto t: res) {
		int u = get<0>(t);
		int v = get<1>(t);
		int w = get<2>(t);
		int val = f[u] ^ f[v];
		if (val != w) flag = false;
	}

	if (flag) {
		for (int i = 1; i <= n; i++)
			cout << f[i] << endl;
	} else {
		cout << -1 << endl;
	}

	return 0;
}