#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;

ll INF = 1e16;
int inf = 1e9;

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (ll i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (ll i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll

#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...)  cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif

void d_err() {
    cerr << endl;
}

template <typename H, typename... T>
void d_err(H h, T... t) {
    cerr << h << " ";
    d_err(t...);
}

template <typename T>
void print(T x) {
    cout << x << "\n";
}

template <typename T>
void print(vector<T>& x) {
    int N = x.size();
    REP(i, N) {
        if (i > 0) cout << " ";
        cout << x[i];
    }
    cout << "\n";
}

template<typename T>
struct UnionFind {
    typedef function<T(const T&, const T&)> OP1;
    typedef function<T(const T&)> OP2;

    vector<int> par;
    vector<T> diff_weight;
    OP1 accum_op;
    OP1 diff_op;
    OP2 neg_op;

    UnionFind(int n,
              /// ↓ edit!!!
              OP1 accum_op=[](const T& a, const T& b) {return a + b;},
              OP1 diff_op=[](const T& a, const T& b) {return a - b;},
              OP2 neg_op=[](const T& a) {return -a;},
              T unity=0
              ): accum_op(accum_op), diff_op(diff_op), neg_op(neg_op) { init(n, unity); }

    void init(int n, T unity=0) {
        par.assign(n, -1);
        diff_weight.assign(n, unity);
    }

    int root(int x) {
        if (par[x] < 0) return x;

        int r = root(par[x]);
        diff_weight[x] = accum_op(diff_weight[x], diff_weight[par[x]]);
        return par[x] = r;
    }

    int issame(int x, int y) {
        return root(x) == root(y);
    }

    T weight(int x) {
        root(x);
        return diff_weight[x];
    }

    // update with diff_op(weight(y), weight(x)) = w
    bool merge(int x, int y, T w = 0) {
        w = accum_op(w, weight(x));
        w = diff_op(w, weight(y));
        x = root(x); y = root(y);

        if (x == y) return false;

        // merge by size
        // force size of x to be bigger than that of y
        if (par[x] > par[y]) swap(x, y), w = neg_op(w);
        par[x] += par[y];
        par[y] = x;
        diff_weight[y] = w;

        return true;
    }

    T diff(int x, int y) {
        return diff_op(weight(y), weight(x));
    }

    ll size(int x) {
        return -par[root(x)];
    }
};

int main_naive(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);


    int n, m; cin >> n >> m;
    vll ans(n, -1);
    vll a(m), b(m), y(m);
    vector<vector<Pll>> edge(n);
    REP(i, m) {
        cin >> a[i] >> b[i];
        cin >> y[i];
        a[i]--, b[i]--;
        edge[a[i]].eb(b[i], y[i]);
        edge[b[i]].eb(a[i], y[i]);
    }

    vector<bool> used(n, false);
    REP(i, n) {
        if (used[i]) continue;

        ans[i] = 1;
        queue<int> q;
        q.push(i);
        while(not q.empty()) {
            auto j = q.front(); q.pop();
            for (auto &e: edge[j]) {
                if (used[e.fi]) continue;
                int v = ans[j] ^ e.se;
                ans[e.fi] = v;
                q.push(e.fi);
                used[e.fi] = true;
            }
        }
    }

    REP(i, m) {
        if ((ans[a[i]] ^ ans[b[i]]) != y[i]) {
            print(-1);
            return 0;
        }
    }

    for(auto &e: ans) {
        print(e);
    }

    return 0;
}

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    int n, m; cin >> n >> m;

    UnionFind<ll> uf(n,
                     [](ll a, ll b) {return a ^ b;},
                     [](ll a, ll b) {return a ^ b;},
                     [](ll a) {return a;});

    REP(i, m) {
        int a, b; cin >> a >> b;
        a--, b--;
        ll y; cin >> y;

        if (uf.issame(a, b)) {
            if (uf.diff(a, b) != y) {
                print(-1);
                return 0;
            }
        } else {
            uf.merge(a, b, y);
        }
    }

    REP(i, n) {
        print(uf.weight(i));
    }
}