#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pcc = pair<char,char>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pdd = pair<ld,ld>;
using tuplis = array<ll,3>;
template<class T> using prique = priority_queue<T,vector<T>,greater<T>>;
#define rep(i,n) for(ll i = 0; i < n; i++)
#define rrep(i,n) for(ll i = n-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())
const ll LINF = 1001001001001001001;
const int INF = 1001001001;
const int MOD = 1000000007;
const int MODD = 998244353;
const ld PI = 3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
inline ll popcnt(ll a){ return __builtin_popcountll(a); }
inline ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
inline ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll gcd(ll a,ll b){ if(a%b == 0){return b; } else{ return gcd(b,a%b); } }
ll lcm(ll a,ll b){ return a/gcd(a,b)*b; }
template<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }
template<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }
template<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }
template<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }
int main() {
    int N,M;
    cin >> N >> M;
    vector<int>ans(N,-1);
    vector<vector<pii>>road(N);
    rep(i,M) {
        int A,B,Y;
        cin >> A >> B >> Y;
        A--;B--;
        road[A].push_back({B,Y});
        road[B].push_back({A,Y});
    }
    rep(i,N) {
        if(ans[i] == -1) {
            ans[i] = 1;
            queue<int>que;
            que.push(i);
            while (!que.empty()) {
                int x = que.front();
                que.pop();
                for(int j = 0; j < road[x].size(); j++) {
                    if(ans[road[x][j].first] == -1) {
                        ans[road[x][j].first] = ans[x]^road[x][j].second;
                        que.push(road[x][j].first);
                    }
                    else {
                        if(ans[road[x][j].first] != (ans[x]^road[x][j].second)) {
                            cout << -1 << endl;
                            return 0;
                        }
                    }
                }
            }
        }
    }
    rep(i,N) {
        cout << ans[i] << endl;
    }
}