#pragma GCC optimize("O3") //#pragma GCC target("avx2") //#pragma GCC optimize("unroll-loops") #include using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef vector vi; typedef vector vll; typedef vector vld; typedef pair Pll; typedef pair Pin; ll INF = 1e16; int inf = 1e9; #define ALL(x) (x).begin(), (x).end() #define FOR(i, m, n) for (ll i = (m); i < (n); ++i) #define REVFOR(i, m, n) for (ll i = (n - 1); i >= (m); --i) #define REP(i, n) FOR(i, 0, n) #define REVREP(i, n) REVFOR(i, 0, n) #define fi first #define se second #define pb push_back #define mp make_pair #define eb emplace_back #define bcnt __builtin_popcountll #ifdef LOCAL #include #define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__); #else #define debug(...) 83; #endif void d_err() { cerr << endl; } template void d_err(H h, T... t) { cerr << h << " "; d_err(t...); } template void print(T x) { cout << x << "\n"; } template void print(vector& x) { int N = x.size(); REP(i, N) { if (i > 0) cout << " "; cout << x[i]; } cout << "\n"; } int main(){ cin.tie(0); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); int n, m; cin >> n >> m; vll ans(n + 1, -1); vll a(m), b(m), y(m); REP(i, m) { cin >> a[i] >> b[i]; cin >> y[i]; if (ans[a[i]] == -1 && ans[b[i]] == -1) { ans[a[i]] = 0; ans[b[i]] = y[i] ^ ans[a[i]]; } else { if (ans[a[i]] == -1) { ans[a[i]] = ans[b[i]]^y[i]; } else if (ans[b[i]] == -1) { ans[b[i]] = ans[a[i]]^y[i]; } else { if ((ans[a[i]] ^ ans[b[i]]) != y[i]) { print(-1); return 0; } } } } REP(i, m) { if ((ans[a[i]] ^ ans[b[i]]) != y[i]) { print(-1); return 0; } } bool first = true; for(auto &e: ans) { if (first) { first = false; continue; } if (e == -1) e = 0; print(e); } }