#include<iostream>
using namespace std;
int n,k,cnt,fa[150005];
int find_fa(int i)
{
	if(fa[i]==i)
	{
		return i;
	}
	fa[i]=find_fa(fa[i]);
	return fa[i];
}
int main()
{
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
	{
		fa[i]=i;
	}
	for(int i=1;i<=k;i++)
	{
		int x,y,flag;
		scanf("%d%d%d",&flag,&x,&y);
		if(x>n||y>n)
		{
			cnt++;
			continue;
		}
		if(flag==2&&x==y)
		{
			cnt++;
			continue;
		}
		if(flag==1)
		{
			if(find_fa(x+n)==find_fa(y+n))
			{
				cnt++;
				continue;
			}
			if(find_fa(x)==find_fa(y))
			{
				cnt++;
				continue;
			}
			fa[find_fa(x)]=find_fa(y);
			fa[find_fa(x+n)]=find_fa(y+n);
			fa[find_fa(x+2*n)]=find_fa(y+2*n);
		}
		else
		{
			if(find_fa(x)==find_fa(y))
			{
				cnt++;
				continue;
			}
			if(find_fa(x)==find_fa(y+n))
			{
				cnt++;
				continue;
			}
			fa[find_fa(x+n)]=find_fa(y);
			fa[find_fa(x)]=find_fa(y+2*n);
			fa[find_fa(x+2*n)]=find_fa(y+n);
		}
	}
	printf("%d",cnt);
	return 0;
}