#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;

ifstream fin ("andrei.in");
ofstream fout ("andrei.out");

const int maxn = 1e5 + 5;
vector <pair <int,int> > G[maxn];
vector <int> V;
bitset <maxn> Vis;
int Ans[maxn];

bool Dfs(int node, int color) {
    vector <pair <int,int> > :: iterator it;
    V.push_back(node);
    if (Vis[node] == true) {
        if (Ans[node] == color) {
            return true;
        } else {
            return false;
        }
    }
    Vis[node] = true;
    Ans[node] = color;
    for (it = G[node].begin(); it!= G[node].end(); it++) {
        if (it->second == 2 && Dfs(it->first, color) == false) {
            return false;
        } else if (it->second == color && Dfs(it->first, color ^ 1) == false) {
            return false;
        }
    }
    return true;
}

int main() {
    ios_base :: sync_with_stdio (false);
    vector <int> :: iterator it;
    int n, m, x, y, c, i;
    fin >> n >> m;
    for (i = 1; i <= m; i++) {
        fin >> x >> y >> c;
        G[x].push_back(make_pair(y, c));
        G[y].push_back(make_pair(x, c));
    }
    for (i = 1; i <= n; i++) {
        if (Vis[i] == false) {
            V.clear();
            if (Dfs(i, 0) == false) {
                for (it = V.begin(); it != V.end(); it++) {
                    Vis[*it] = false;
                }
                Dfs(i, 1);
            }
        }
    }
    for (i = 1; i <= n; i++) {
        fout << Ans[i] << " ";
    }
    fin.close();
    fout.close();
    return 0;
}