#include <stdio.h>
#include <string.h>
#include <vector>

using namespace std;

#define MAX_N 200010

int n, m, k;

int use[MAX_N], Q[MAX_N], comp[MAX_N], val[MAX_N];

vector <int> G[MAX_N], Gt[MAX_N], ctc[MAX_N];
                  
inline int neg(int x) {
	if (x <= n)
		return x + n;
	return x - n;
}

void dfs(int nod) {
	use[nod] = 1;

	for (vector <int>::iterator it = G[nod].begin(); it != G[nod].end(); ++it)
		if (use[*it] == 0) 
			dfs(*it);

	Q[++Q[0]] = nod;
}

void dfs2(int nod) {
	use[nod] = 1;
	ctc[k].push_back(nod);
	comp[nod] = k;

    for (vector <int>::iterator it = Gt[nod].begin(); it != Gt[nod].end(); ++it)
        if (use[*it] == 0)
            dfs2(*it);
}

void solve() {
	for (int i = 1; i <= 2 * n; i++)
		for (vector <int>::iterator it = G[i].begin(); it != G[i].end(); ++it)
			Gt[*it].push_back(i); //graful transpus

	for (int i = 1; i <= 2 * n; i++)
		if (use[i] == 0)
			dfs(i);

	memset(use, 0, sizeof(use));
	for (int i = 1; i <= 2 * n; i++)
		if (use[Q[i]] == 0) {
			++k; //am gasit o noua componenta tare conexa
			dfs2(Q[i]);
		}

	for (int i = 1; i <= k; i++)
		val[i] = -1;

	for (int i = 1; i <= k; i++)
		if (val[i] == -1) {
        	val[i] = 0;
			for (vector <int>::iterator it = G[i].begin(); it != G[i].end(); ++it)
				val[comp[neg(*it)]] = 1;
		}

	for (int i = 1; i <= n; i++)
		printf("%d ", val[comp[i]]);
	printf("\n");
}

int main() {

	freopen("andrei.in", "r", stdin);
	freopen("andrei.out", "w", stdout);

	scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++) {
		int x, y, tip;
		scanf("%d %d %d", &x, &y, &tip);

		if (tip == 0) {
        	G[x].push_back(neg(y));
			G[y].push_back(neg(x));
		}

		if (tip == 1) {
        	G[neg(x)].push_back(y);
			G[neg(y)].push_back(x);
		}

		if (tip == 2) {
        	G[x].push_back(y);
			G[y].push_back(x);
		}
	}

	solve();

	return 0;
}