#include <bits/stdc++.h>

#define MAXN 200005

int N, M, Color[MAXN];
std::vector <int> ADC[MAXN], TopSort;
bool Seen[MAXN];

inline void AddEdge(int X, int Y) {
    ADC[-X+N].push_back(Y+N);
    ADC[-Y+N].push_back(X+N);
}

void DFS(int Vertex) {
    Seen[Vertex] = 1;
    for (auto Edge:ADC[Vertex])
        if (!Seen[Edge])
            DFS(Edge);
    TopSort.push_back(Vertex);
}

std::ifstream In ("andrei.in");
std::ofstream Out("andrei.out");

void Citire() {
    In >> N >> M;
    for (int i=1, X, Y, W; i<=M; ++i) {
        In >> X >> Y >> W;
        if (W == 0)
            AddEdge(X, Y);
        else if (W == 1)
            AddEdge(-X, -Y);
        else if (W == 2)
            AddEdge(X, -Y), AddEdge(-X, Y);
    }
}

void Rezolvare() {
    for (int i=0; i<=2*N; ++i)
        if (!Seen[i]) DFS(i);

    for (int i=TopSort.size()-1, X, Y; i>=0; --i) {
        X = TopSort[i] - N;
        Y = -X;
        X += N, Y += N;

        if (!Color[X] && !Color[Y])
            Color[Y] = 1;
    }

    for (int i=1; i<=N; ++i, Out << ' ')
        Out << Color[i+N];
}

int main()
{
    Citire();
    Rezolvare();

    return 0;
}