#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T> ostream &operator<<(ostream &os, const vector<T> &as);
template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


struct Scc {
  int n;
  vector<int> as, bs;
  vector<int> ptr, zu, us;

  int l;
  vector<int> ids;
  int operator[](int u) const { return ids[u]; }

  Scc() {}
  explicit Scc(int n_) : n(n_), as(), bs(), l(-1) {}
  void ae(int u, int v) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    as.push_back(u);
    bs.push_back(v);
  }

  void dfs0(int u) {
    if (!ids[u]) {
      ids[u] = -1;
      for (int i = ptr[u]; i < ptr[u + 1]; ++i) dfs0(zu[i]);
      us.push_back(u);
    }
  }
  void dfs1(int u) {
    if (!~ids[u]) {
      ids[u] = l;
      for (int i = ptr[u]; i < ptr[u + 1]; ++i) dfs1(zu[i]);
    }
  }
  void run() {
    const int m = as.size();
    ptr.resize(n + 2);
    zu.resize(m);
    for (int u = 0; u < n + 2; ++u) ptr[u] = 0;
    for (int i = 0; i < m; ++i) ++ptr[as[i] + 2];
    for (int u = 2; u < n + 1; ++u) ptr[u + 1] += ptr[u];
    for (int i = 0; i < m; ++i) zu[ptr[as[i] + 1]++] = bs[i];
    ids.assign(n, 0);
    us.clear();
    for (int u = 0; u < n; ++u) dfs0(u);
    for (int u = 0; u < n + 2; ++u) ptr[u] = 0;
    for (int i = 0; i < m; ++i) ++ptr[bs[i] + 2];
    for (int u = 2; u < n + 1; ++u) ptr[u + 1] += ptr[u];
    for (int i = 0; i < m; ++i) zu[ptr[bs[i] + 1]++] = as[i];
    l = 0;
    for (int j = n; --j >= 0; ) if (!~ids[us[j]]) { dfs1(us[j]); ++l; }
  }

  vector<vector<int>> group() const {
    assert(~l);
    vector<vector<int>> uss(l);
    for (int u = 0; u < n; ++u) uss[ids[u]].push_back(u);
    return uss;
  }
};  // Scc


int N, M;
vector<int> A, B, C;

vector<vector<pair<int, int>>> graph0, graph1;
vector<int> vis, fs;
bool dfs(int u, int f) {
  if (vis[u]) return (fs[u] == f);
  vis[u] = 1;
  fs[u] = f;
  for (const auto &e : graph0[u]) {
    const int ff = f + e.first;
    const int v = e.second;
    if (!dfs(v, ff)) return false;
  }
  return true;
}

int main() {
  for (; ~scanf("%d%d", &N, &M); ) {
    A.resize(M);
    B.resize(M);
    C.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%d%d%d", &A[i], &B[i], &C[i]);
      --A[i];
      --B[i];
    }
    
    const int n = N + N;
    Scc scc(n);
    vector<int> as, bs, cs;
    auto ae = [&](int u, int v, int c) -> void {
// cerr<<u<<" "<<v<<" "<<c<<endl;
      scc.ae(u, v);
      as.push_back(u);
      bs.push_back(v);
      cs.push_back(c);
    };
    for (int i = 0; i < M; ++i) {
      const int c = C[i] ? -1 : +1;
      ae(A[i], N + B[i], +c);
      ae(N + A[i], B[i], -c);
    }
    scc.run();
    const auto uss = scc.group();
// cerr<<"uss = "<<uss<<endl;
    
    const int m = as.size();
    graph0.assign(n, {});
    graph1.assign(n, {});
    for (int i = 0; i < m; ++i) {
      ((scc[as[i]] == scc[bs[i]]) ? graph0 : graph1)[as[i]].emplace_back(cs[i], bs[i]);
    }
    
    vis.assign(n, 0);
    fs.assign(n, 0);
    vector<int> bad(scc.l, 0);
    vector<vector<int>> start(n);
    start[0].push_back(0);
    for (int x = 0; x < scc.l; ++x) {
      for (const int u : uss[x]) for (const int f : start[u]) {
        if (!dfs(u, f)) bad[x] = 1;
      }
      for (const int u : uss[x]) if (vis[u]) {
        for (const auto &e : graph1[u]) {
          const int ff = fs[u] + e.first;
          const int v = e.second;
          start[v].push_back(ff);
          if (bad[x]) bad[scc[v]] = 1;
        }
      }
    }
// cerr<<"vis = "<<vis<<endl;
// cerr<<"fs = "<<fs<<endl;
// cerr<<"bad = "<<bad<<endl;
    
    vector<int> ans(N);
    for (int u = 0; u < N; ++u) ans[u] = (bad[scc[u]] || bad[scc[N + u]]) ? -1 : max(abs(fs[u]), abs(fs[N + u]));
    for (int u = 0; u < N; ++u) printf("%d\n", ans[u]);
  }
  return 0;
}