#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

bool dfs(vector<vector<pair<int, int>>> &tree, vector<int> &ans, int now) {
  bool res = false;
  for(auto [nx, y] : tree.at(now)) {
    if(ans.at(nx) != -1) {
      if((ans.at(nx) ^ ans.at(now)) != y) return true;
      continue;
    }
    ans.at(nx) = ans.at(now) ^ y;
    res |= dfs(tree, ans, nx);
  }
  return res;
}

int main() {
  int n, m;
  cin >> n >> m;
  vector tree(n, vector<pair<int, int>>());
  map<pair<int, int>, int> mp;
  rep(i, m) {
    int a, b;
    cin >> a >> b;
    a--; b--;
    int y;
    cin >> y;
    if(mp.find({a, b}) != mp.end()) {
      if(mp[{a, b}] != y) {
        cout << -1 << endl;
        return 0;
      }
    } else {
      tree.at(a).push_back({b, y});
      tree.at(b).push_back({a, y});
      mp[{a, b}] = y;
    }
  }

  vector<int> ans(n, -1);
  rep(i, n) {
    if(ans.at(i) == -1) {
      ans.at(i) = 0;
      bool r = dfs(tree, ans, i);
      if(r == true) {
        cout << -1 << endl;
        return 0;
      }
    }
  }
  rep(i, n) {
    cout << ans.at(i) << endl;
  }
  return 0;
}