#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f ("andrei.in");
ofstream g ("andrei.out");

const int NMAX = 100000 + 1;

int n, m;
bool vizitat[NMAX];
int sol[NMAX];
vector <int> graf[NMAX], culoare[NMAX];

void citeste() {
    f >> n >> m;
    int a, b, c;
    for (int i = 1; i <= n; i++) {
        f >> a >> b >> c;
        graf[a].push_back(b); culoare[a].push_back(c);
        graf[b].push_back(a); culoare[b].push_back(c);
    }
}

bool DFS(int nod, int multime) {
    if (vizitat[nod]) {
        if (sol[nod] != multime) return false;
        return true;
    }
    vizitat[nod] = true;
    sol[nod] = multime;
    int fiu, c, l = graf[nod].size();
    for (int i = 0; i < l; i++) {
        fiu = graf[nod][i];
        c = culoare[nod][i];
        if (c == 2) if (!DFS(fiu, multime)) return false;
        if (c == 0 && multime == 0) if (!DFS(fiu, 1)) return false;
        if (c == 1 && multime == 1) if (!DFS(fiu, 0)) return false;
    }
    return true;
}

void rezolva() {
    for (int i = 1; i <= n; i++)
        if (!vizitat[i]) {
            if (! DFS(i, 0)) {
                for (int j = 1; j <= n; j++) vizitat[j] = false;
                DFS(i, 1);
            }
        }
    for (int i = 1; i <= n; i++)
        g << sol[i] << ' ';
}

int main() {
    citeste();
    rezolva();
    return 0;
}