#include<bits/stdc++.h>
using namespace std;
ifstream f("andrei.in");
ofstream g("andrei.out");
int n, m, color[100002];
vector<pair<int, int> >v[100002];
bool viz[100002];
int beg;
void dfs(int nod, int col)
{
    viz[nod] = 1;
    if(nod == beg)
    {
        bool nn = 1;
        for(int i = 0; i < v[nod].size(); ++i)
        {
            int vecin = v[nod][i].first;
            int cl = v[nod][i].second;
            if(viz[vecin] && cl == 2)
            {
                nn = 0;
                color[nod] = color[vecin];
                break;
            }
            else
                if(viz[vecin] && cl == color[vecin])
                {
                    nn = 0;
                    color[nod] = color[vecin] ^ 1;
                    break;
                }
        }
        if(nn)
            color[nod] = col;
    }
    else
        color[nod] = col;
    for(int i = 0; i < v[nod].size(); ++i)
    {
        int vecin = v[nod][i].first;
        int cc = v[nod][i].second;
        if(!viz[vecin] && cc == col)
            dfs(vecin, col ^ 1);
        else
            if(!viz[vecin] && cc == 2)
                dfs(vecin, col);
    }
    for(int i = 0; i < v[nod].size(); ++i)
    {
        int vecin = v[nod][i].first;
        int cc = v[nod][i].second;
        if(!viz[vecin] && cc == 1)
            dfs(vecin, col);
    }
}
int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        int a, b, c;
        f >> a >> b >> c;
        v[a].push_back({b, c});
        v[b].push_back({a, c});
    }
    for(int i = 1; i <= n; ++i)
        if(!viz[i])
            beg = i, dfs(i, 0);
    for(int i = 1; i <= n; ++i)
        g << color[i] << " ";
    return 0;
}