#include <bits/stdc++.h>

#define vi vector<int>
#define pb push_back
#define mp make_pair

using namespace std;

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

const int maxN = (int)2e5;

int n, m;

vi g[maxN], r[maxN];

vi st;

int comp[maxN];

bool used[maxN];

int non(int x) {
  if (x < n) {
    return x + n;
  }
  return x - n;
}

void dfs(int u) {
  used[u] = true;
  for (int v : g[u]) {
    if (!used[v]) {
      dfs(v);
    }
  }
  st.pb(u);
}

void dfs2(int u, int cnt) {
  used[u] = true;
  comp[u] = cnt;
  for (int v : r[u]) {
    if (!used[v]) {
      dfs2(v, cnt);
    }
  }
}

void add(int u, int v) {
  g[non(u)].pb(v);
  r[v].pb(non(u));
}

vector<int> solve2Sat(vector<pair<int, int>> edges) {
  vector<int> result;
  for (auto &pi : edges) {
    add(pi.first, pi.second);
    add(pi.second, pi.first);
  }
  for (int i = 0; i < 2 * n; i++) {
    if (!used[i]) {
      dfs(i);
    }
  }
  fill(used, used + 2 * n, false);
  int cnt = 0;
  reverse(st.begin(), st.end());
  for (int &v : st) {
    if (!used[v]) {
      dfs2(v, cnt++);
    }
  }
  for (int i = 0; i < n; i++) {
    if (comp[i] == comp[i + n]) {
      return result;
    }
  }
  for (int i = 0; i < n; i++) {
    if (comp[i] < comp[i + n]) {
      result.pb(0);
    } else {
      result.pb(1);
    }
  }
  return result;
}

int main() {
  in >> n >> m;
  vector<pair<int, int>> edges;
  for (int i = 0; i < m; i++) {
    int u, v, z;
    in >> u >> v >> z;
    u--; v--;
    if (z == 1) {
      edges.pb(mp(non(u), non(v)));
    } else if (z == 0) {
      edges.pb(mp(u, v));
    } else {
      edges.pb(mp(non(u), v));
      edges.pb(mp(u, non(v)));
    }
  }
  vector<int> result = solve2Sat(edges);
  for (int &v : result) {
    out << !v << " ";
  }
  return 0;
}