#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>

#define newn G[nod][i]

using namespace std;

ifstream fin("andrei.in");
ofstream fout("andrei.out");

const int Nmax = 2e5 + 100;

int N, M;
queue <int> Q, Initialize;
vector <int> G[Nmax];
vector <bool> viz(Nmax), val(Nmax);

inline int Not(int x)
{
    return (x <= N ? x + N : x - N);
}

inline void Add(int x, int y)
{
    G[x].push_back(y);
    G[y].push_back(x);
}

void Clear()
{
    while(!Q.empty())
    {
        int x = Q.front(); Q.pop();
        viz[x] = viz[Not(x)] = 0;
    }
}

bool DFS(int nod)
{
    Q.push(nod);
    for(size_t i = 0; i < G[nod].size(); i++)
        if(viz[newn])
            if(!val[newn]) return 0;
            else;
        else
        {
            viz[newn] = viz[Not(newn)] = 1;
            val[newn] = 1; val[Not(newn)] = 0;
            if(!DFS(Not(newn)))
                return 0;
        }
    return 1;
}

bool Right(int nod, bool v)
{
    val[nod] = v; val[Not(nod)] = !v;
    viz[nod] = viz[Not(nod)] = 1;
    if(v == 0)
        return DFS(nod);
    else
        return DFS(Not(nod));
}

int main()
{
    fin >> N >> M;
    for(int i = 1; i <= M; i++)
    {
        int x, y, tip;
        fin >> x >> y >> tip;

        if(tip == 0)
            Add(x, y);
        else if(tip == 1)
            Add(Not(x), Not(y));
        else
            Add(Not(x), y), Add(x, Not(y));
    }

    for(int i = 1; i <= N; i++)
        if(!viz[i])
            if(!Right(i, 0))
            {
                Clear();
                if(!Right(i, 1))
                {
                    return -1;
                    fout << "Error";
                }
                Q = Initialize;
            }
    for(int i = 1; i <= N; i++)
        fout << val[i] << ' ';
    return 0;
}