#include <cstdio>
#include <vector>

#define NMAX 200007
#define neg(a) (a^1)

using namespace std;
int n, m, x, y, p, viz[NMAX], sol[NMAX], tmp;
vector <int> adj[NMAX], adjp[NMAX], order;

void convert(int &a)
{
    if(a < 0) a = (((0-a) << 1) | 1);
    else a = (a<<1);
}
void add(int a, int b)
{
    adj[a].push_back(b);
    adjp[b].push_back(a);
    //printf("muchie %d %d\n", a, b);
}
void dfs(int nod)
{
    viz[nod] = 1;
    for(int i = adj[nod].size()-1; i+1; --i)
    {
        if(!viz[adj[nod][i]]) dfs(adj[nod][i]);
    }
    order.push_back(nod);
}
void dfsat(int nod)
{
    viz[nod] = 0;
    sol[neg(nod)] = 1;
    for(int i = adjp[nod].size()-1; i+1; --i)
    {
        if(viz[adjp[nod][i]]) dfsat(adjp[nod][i]);
    }
}
void sortare()
{
    for(int i = 1; i<= n; ++i)
    {
        tmp = (i<<1);
        if(!viz[tmp]) dfs(tmp);
        tmp = tmp | 1;
        if(!viz[tmp]) dfs(tmp);
    }
    //for(int i = 0; i< order.size(); ++i) printf("%d ", order[i]);
    //printf("\n");
}
void sat()
{
    for(int i = order.size()-1; i+1; --i)
    {
        if(viz[order[i]] && viz[neg(order[i])]) dfsat(order[i]);
    }
}

int main()
{
    freopen("andrei.in", "r", stdin);
    freopen("andrei.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(int i = 1; i<= m; ++i)
    {
        scanf("%d %d %d", &x, &y, &p);
        convert(x); convert(y);
        if(p == 0)
        {
            add(y, neg(x));
            add(x, neg(y));
        }
        if(p == 1)
        {
            add(neg(y), x);
            add(neg(x), y);
        }
        if(p == 2)
        {
            add(x, y);
            add(y, x);
            add(neg(x), neg(y));
            add(neg(x), neg(y));
        }
    }
    sortare();
    sat();
    for(int i = 1; i<= n; ++i) printf("%d ", sol[(i<<1)]);
    printf("\n");
    return 0;
}