#include<bits/stdc++.h>
using namespace std;
int n,m,fa[500001],tian[500001],lie[500001];
long long ans=0;
int find(int x)
{
	if(x==fa[x])return x;
	else 
	{
		return fa[x]=find(fa[x]);
	}
}
void he(int i,int j)
{
	int i_fa=find(i);
	int j_fa=find(j);
	if(j_fa!=i_fa)
	{
		fa[i_fa]=j_fa;
		tian[i_fa]=tian[j_fa];
		lie[i_fa]=lie[j_fa];
	}
	
}
void init()
{
	for(int i=1;i<=n;i++)
	{
		fa[i]=i;
	}
}
int main()
{
	cin>>n>>m;
	init();
	for(int i=1;i<=m;i++)
	{
		int x,y,d;
		cin>>d>>x>>y;
		if(x>n||y>n)
		{
			ans++;
			continue;
		}
		if(d==1&&(find(tian[y])==find(x)||find(x)==find(lie[y])))
		{
			ans++;
			continue;
		}
		if(d==2&&(find(x)==find(y)||find(x)==find(lie[y])))
		{
			ans++;
			continue;
		}
		if(d==1)
		{
			he(x,y);
		}
		if(d==2)
		{
			tian[y]=x;
			lie[x]==y;
			tian[tian[x]]=y;
		}
	}
	cout<<ans;
	return 0;
}