#include <bits/stdc++.h>

#define non(x) (x < n) ? x + n : x - n

using namespace std;

ifstream in("andrei.in");
ofstream out("andrei.out");

const int maxN = 200000;

int n, m;

vector<int> g[maxN];

vector<int> r[maxN];

bitset<maxN> used;

bitset<maxN> comp;

vector<int> st;

void dfs(int u) {
  used[u] = 1;
  for (auto &v : g[u]) {
    if (used[v] == 0) {
      dfs(v);
    }
  }
  st.push_back(u);
}

void dfs2(int &u) {
  used[u] = used[non(u)] = 0;
  comp[u] = 1;
  for (auto &v : r[u]) {
    if (used[v] == 1) {
      dfs2(v);
    }
  }
}

void addEdge(int u, int v) {
  int nu = non(u), nv = non(v);
  g[nv].push_back(u);
  r[u].push_back(nv);
  g[nu].push_back(v);
  r[v].push_back(nu);
}

int main() {
  int u, v, z, nu, nv;
  in >> n >> m;
  for (int i = 0; i < m; i++) {
    in >> u >> v >> z;
    u--; v--;
    if (z == 1) {
      addEdge(u, v);
    } else if (z == 0) {
      addEdge(non(u), non(v));
    } else {
      addEdge(non(u), v);
      addEdge(u, non(v));
    }
  }
  for (int i = 0; i < 2 * n; i++) {
    if (used[i] == 0) {
      dfs(i);
    }
  }
  reverse(st.begin(), st.end());
  for (auto &v : st) {
    if (used[v] == 1 && used[non(v)] == 1) {
      dfs2(v);
    }
  }
  for (int i = 0; i < n; i++) {
    out << !comp[i] << " ";
  }
  in.close(); out.close();
  return 0;
}