#include <stdio.h>
#include <vector>
#include <time.h>
#include <string.h>
#define NMAX 100005
#define LMAX 200005
#define NR 3
#define pb push_back
using namespace std;
int n,m,B[NMAX],C[NMAX],r,t;
vector <int> A[NMAX][NR];
char marc[NMAX];
struct muchie
{
	int a,b,c;
};
muchie D[LMAX];
void read()
{
	scanf("%d%d",&n,&m);
	int i,x,y,z;
	for (i=1; i<=m; i++)
	{
		scanf("%d%d%d",&x,&y,&z);
		D[i].a=x; D[i].b=y; D[i].c=z;
		A[x][z].pb(y);
		A[y][z].pb(x);
	}
}
inline int verif()
{
	int i,x,y,z;
	for (i=1; i<=m; i++)
	{
		x=D[i].a; y=D[i].b; z=D[i].c;
		if (!marc[x] && !marc[y] && z==0)
			return 0;
		if (marc[x] && marc[y] && z==1)
			return 0;
		if (((marc[x] && !marc[y]) || (!marc[x] && marc[y])) && z==2)
			return 0;
	}
	return 1;
}
void solve1()
{
	int i,j,win;
	for (i=0; i<(1<<n); i++)
	{
		for (j=1; j<=n; j++)
			if (i & 1<<(j-1))
				marc[j]=1;
			else
				marc[j]=0;
		if (verif())
		{
			win=i;
			break ; 
		}
	}
	for (i=1; i<=n; i++)
		if (win & 1<<(i-1))
			printf("1 ");
		else
			printf("0 ");
	printf("\n");
}
/*void init()
{
	int i
	for (i=1; i<=n; i++)
		B[++r]=i;
}
void solve()
{
	srand(time(0));
	int find=0,act,nod;
	while (!find)
	{
		init();
		act=rand()%r+1; nod=B[act];
		C[++t]=nod;
	}
}*/
int main()
{
	freopen("andrei.in","r",stdin);
	freopen("andrei.out","w",stdout);
	read();
	if (n<20)
	{
		solve1();
		return 0;
	}
	//solve();
	return 0;
}