#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <deque>
#define maxN 100002
using namespace std;
int n, m, i, j, sol[maxN], Sol[maxN];
vector < pair < int, int > > V[maxN];
deque < int > q;
void read()
{
    int x, y, z;
    freopen("andrei.in", "r", stdin);
    scanf("%d %d", &n, &m);
    while (m --)
    {
        scanf("%d %d %d", &x, &y, &z);
        V[x].push_back(make_pair(y, z));
        V[y].push_back(make_pair(x, z));
    }
}
int dfs(int node)
{
    int i, x;
    for (i = 0; i < V[node].size(); ++ i)
        if (sol[V[node][i].first] == -1)
    {
        x = V[node][i].first;
        if (V[node][i].second == 0 && sol[node] == 0)
        {
            sol[x] = 1;
            dfs(x);
        }
        else
            if (V[node][i].second == 1 && sol[node] == 1)
        {
            sol[x] = 0;
            dfs(x);
        }
        else
            if (V[node][i].second == 2)
        {
            sol[x] = sol[node];
            dfs(x);
        }
        else
        {
            sol[x] = 0;
            memcpy(Sol, sol, sizeof(Sol));
            if (!dfs(x))
            {
                memcpy(sol, Sol, sizeof(Sol));
                sol[x] = 1;
                dfs(x);
            }
        }
    }
    else
    {
        x = V[node][i].first;
        if (V[node][i].second == 0 && sol[node] == 0 && sol[x] == 0)
            return 0;
        if (V[node][i].second == 1 && sol[node] == 1 && sol[x] == 1)
            return 0;
        if (V[node][i].second == 2 && sol[node] != sol[x])
            return 0;
    }
    return 1;
}
void solve()
{
    int i;
    for (i = 1; i <= n; ++ i)
        sol[i] = -1;

    for (i = 1; i <= n; ++ i)
        if (sol[i] == -1)
    {
        memcpy(Sol, sol, sizeof(Sol));
        sol[i] = 0;
        if (!dfs(i))
        {
            memcpy(sol, Sol, sizeof(Sol));
            sol[i] = 1;
            dfs(i);
        }
    }
}
void write()
{
    freopen("andrei.out", "w", stdout);
    for (i = 1; i <= n; ++ i)
        printf("%d ", sol[i]);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}