#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;
bool used[100000];

struct edge{
    int to, y;
};

vector<edge> g[100000];
int ans[100000];

bool dfs(int v, int x){
    used[v] = true;
    ans[v] = x;
    for(edge e : g[v]){
        if(!used[e.to]){
            if(!dfs(e.to, x^e.y)) return false;
        }else{
            if(ans[e.to] != (x^e.y)) return false;
        }
    }
    return true;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m; cin >> n >> m;
    for(int i = 0; i < m; i++){
        int a, b, y; cin >> a >> b >> y; a--; b--;
        g[a].push_back(edge{b, y});
        g[b].push_back(edge{a, y});
    }
    for(int i = 0; i < n; i++){
        if(!used[i]){
            if(!dfs(i, 0)){
                cout << -1 << endl;
                return 0;
            }
        }
    }
    
    for(int v = 0; v < n; v++){
        for(edge e : g[v]) assert(ans[v]^ans[e.to] == e.y);
    }
    for(int i = 0; i < n; i++) cout << ans[i] << endl;
}