#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, M;
  cin >> N >> M;
  vector<vector<pair<int, int>>> E(N);
  for (int i = 0; i < M; i++){
    int A, B, Y;
    cin >> A >> B >> Y;
    A--;
    B--;
    E[A].push_back(make_pair(Y, B));
    E[B].push_back(make_pair(Y, A));
  }
  bool ok = true;
  vector<int> X(N, -1);
  for (int i = 0; i < N; i++){
    if (X[i] == -1){
      X[i] = 0;
      queue<int> Q;
      Q.push(i);
      while (!Q.empty()){
        int v = Q.front();
        Q.pop();
        for (auto P : E[v]){
          int Y = P.first;
          int w = P.second;
          if (X[w] == -1){
            X[w] = X[v] ^ Y;
            Q.push(w);
          } else if (X[w] != (X[v] ^ Y)){
            ok = false;
          }
        }
      }
    }
  }
  if (!ok){
    cout << -1 << endl;
  } else {
    for (int i = 0; i < N; i++){
      cout << X[i] << endl;
    }
  }
}