import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


alias Value = int;
int root(int[] ps, Value[] qs, int u) {
  if (ps[u] < 0) {
    return u;
  } else {
    int r = root(ps, qs, ps[u]);
    qs[u] ^= qs[ps[u]];
    return (ps[u] = r);
  }
}
bool connect(int[] ps, Value[] qs, int u, int v, Value c) {
  int ru = root(ps, qs, u);
  int rv = root(ps, qs, v);
  const Value cc = c ^ qs[u] ^ qs[v];
  if (ru == rv) return (cc == 0);
  if (ps[ru] > ps[rv]) { swap(ru, rv); /*cc *= -1;*/ }
  ps[ru] += ps[rv]; ps[rv] = ru; qs[rv] = cc;
  return true;
}


void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      auto A = new int[M];
      auto B = new int[M];
      auto Y = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
        Y[i] = readInt();
      }
      
      auto ps = new int[N];
      auto qs = new int[N];
      ps[] = -1;
      bool ok = true;
      foreach (i; 0 .. M) {
        if (!connect(ps, qs, A[i], B[i], Y[i])) {
          ok = false;
          break;
        }
      }
      
      if (ok) {
        foreach (u; 0 .. N) {
          root(ps, qs, u);
        }
        foreach (u; 0 .. N) {
          writeln(qs[u]);
        }
      } else {
        writeln(-1);
      }
    }
  } catch (EOFException e) {
  }
}