#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <deque>
#define maxN 100002
using namespace std;
int n, m, i, j, 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));
    }
}
void bfs()
{
    int node, i;
    for (i = 1; i <= n; ++ i)
        sol[i] = -1;
    q.push_back(1);
    sol[1] = 0;
    while (!q.empty())
    {
        node = q.front();
        q.pop_front();
        for (i = 0; i < V[node].size(); ++ i)
            if (sol[V[node][i].first] == -1)
        {
            if (sol[node] == 0 && V[node][i].second == 0)
                sol[V[node][i].first] = 1;
            else
                 if (sol[node] == 1 && V[node][i].second == 1)
                    sol[V[node][i].first] = 0;
            else
                if (V[node][i].second == 2)
                   sol[V[node][i].first] = sol[node];
            else
                continue;
            q.push_back(V[node][i].first);
        }
    }
}
void write()
{
    freopen("andrei.out", "w", stdout);
    for (i = 1; i <= n; ++ i)
        printf("%d ", sol[i]);
}
int main()
{
    read();
    bfs();
    write();
    return 0;
}