#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];
vector < int > vis;
deque < int > q;
bool used[maxN];
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 c)
{
    int i, x, y;
    if (used[node])
        return sol[node] == c;
    used[node] = 1;
    sol[node] = c;
    vis.push_back(node);

    for (i = 0; i < V[node].size(); ++ i)
    {
        x = V[node][i].first;
        y = V[node][i].second;
        if (c == 0 && y == 0 && !dfs(x, 1))
           return 0;
        if (c == 1 && y == 1 && !dfs(x, 0))
            return 0;
        if (y == 2 && !dfs(x, c))
            return 0;
    }

    return 1;
}
void solve()
{
    int i;
    for (i = 1; i <= n; ++ i)
        used[i] = 0;

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