#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
int n, m;
vector<P> g[100010];
int y[100010];
int a[100010], b[100010];
bool used[100010];
int ans[100010];
bool dame;
void dfs(int x){
    used[x]=1;
    for(auto p:g[x]){
        int z=p.first;
        int i=p.second;
        if(!used[z]){
            ans[z]=(y[i]^ans[x]);
            dfs(z);
        }else if(ans[z]!=(y[i]^ans[x])){
            dame=1;
        }
    }
}
int main()
{
    cin>>n>>m;
    for(int i=0; i<m; i++){
        cin>>a[i]>>b[i]>>y[i];
        a[i]--; b[i]--;
        g[a[i]].push_back({b[i], i});
        g[b[i]].push_back({a[i], i});
    }
    for(int i=0; i<n; i++){
        if(!used[i]){
            dfs(i);
        }
    }
    if(dame) cout<<-1<<endl;
    else{
        for(int i=0; i<n; i++) cout<<ans[i]<<endl;
    }
    return 0;
}