#include <iostream>
#include <cstdio>
#include <vector>
#include <bitset>
#include <vector>

#define N 100005

using namespace std;

vector <pair<int,int>> g[N];
vector <int> q;
int n,m,x,y,c;
bitset <N> viz;
int culoare[N];

bool dfs(int nod, int val){
    q.push_back(nod);
    if(viz[nod]){
        return culoare[nod] == val;
    }
    viz[nod] = 1;
    culoare[nod] = val;
    for(auto i : g[nod]){
        if(i.second == 0 && val == 0){
            if(!dfs(i.first,1))
                return false;
        }
        if(i.second == 1 && val == 1){
            if(!dfs(i.first,0))
                return false;
        }
        if(i.second == 2){
            if(!dfs(i.first,val))
                return false;
        }
    }

    return true;
}

int main()
{
    freopen("andrei.in","r",stdin);
    freopen("andrei.out","w",stdout);

    scanf("%d%d", &n, &m);
    for(int i = 0; i < m; ++i){
        scanf("%d%d%d", &x,&y,&c);
        g[x].push_back({y,c});
        g[y].push_back({x,c});
    }

    for(int i = 1; i <= n; ++i){
        if(!viz[i]){
            q.clear();
            if(!dfs(i,0)){
                for(int j : q)
                    viz[j] = 0;
                dfs(i,1);
            }
        }
    }

    for(int i = 1; i <= n; ++i)
        cout<<culoare[i]<<" ";

    return 0;
}