#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

struct edge{
        int to, cost;
        edge(){}
        edge(int a, int b) : to(a), cost(b){}
    };
using ve = vector<edge>;

bool ok = true;

void dfs(int v, vec &res, vector<ve> &G){
    if(res[v] == -1) res[v] = 0;
    for(const edge &e : G[v]){
        if(res[e.to] == -1){
            res[e.to] = e.cost ^ res[v];
            dfs(e.to, res, G);
        }else if(res[e.to] != (res[v] ^ e.cost)){
            ok = false;
        }
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N>>M;
    vector<ve> G(N);
    rep(i, M){
        int a, b, y;
        cin>>a>>b>>y;
        --a; --b;
        G[a].emplace_back(b, y);
        G[b].emplace_back(a, y);
    }
    vec res(N, -1);
    rep(i, N) if(res[i] == -1) dfs(i, res, G);
    if(ok) rep(i, N) cout<<res[i]<<endl;
    else cout<<-1<<endl;
}