#ifdef MAIN bool __multi__ = 0; using INT = long long; namespace XK { struct UF { int N; V fa, data; UF(int n) : N(n) { fa.resize(N); data.assign(N, 0); rep(i, N) fa[i] = i; } int root(int x) { if(fa[x] == x) return x; int f = fa[x]; int faa = root(fa[x]); fa[f] = faa; data[x] ^= data[f]; return faa; } int merge(int x, int y, int v) { int rx = root(x), ry = root(y); if(rx == ry) { if((data[x] ^ data[y]) != v) return -1; return 0; } fa[rx] = y, data[rx] = v ^ data[x]; return 0; } }; void solve() { INT N, M; cin >> N >> M; UF UF(N); rep(i, M) { INT A, B, M; cin >> A >> B >> M; -- A, -- B; if(UF.merge(A, B, M) == -1) {return cout << "-1\n", void();} } rep(i, N) UF.root(i); rep(i, N) cout << UF.data[i] << "\n"; } }; #else #include "cassert" #include "cmath" #include "cstdint" #include "cstdio" #include "cstdlib" #include "cstring" #include "algorithm" #include "bitset" #include "chrono" #include "complex" #include "deque" #include "functional" #include "iostream" #include "limits" #include "map" #include "numeric" #include "queue" #include "random" #include "set" #include "sstream" #include "string" #include "unordered_map" #include "unordered_set" #include "utility" #include "vector" #include "array" using namespace std; #define int long long using ll = long long; using ull = unsigned long long; const ll INF = 1ll << 60; const ll LINF = 0x1fffffffffffffff; const ll MINF = 0x7fffffffffff; template bool chmax(A& l, const B& r){ return r > l ? l = r, 1 : 0; } template bool chmin(A& l, const B& r){ return r < l ? l = r, 1 : 0; } #define sz(x) ssize(x) #define rep(i, a) for(ll i = 0; i < (a); i ++) #define Rep(i, a, b) for(ll i = (a); i < (b); i ++) #define rrep(i, a, b) for(ll i = (b); i --> (a); ) #define all(x) begin(x), end(x) #define fst first #define snd second #define pb push_back template using V = vector; template using AR = array; #define MAIN #include __FILE__ signed main() {ios::sync_with_stdio(0);cin.tie(0);fixed(cout).precision(12);int t = 1;if(__multi__) cin >> t;while(t --) XK::solve();} #endif