#include<bits/stdc++.h>
using namespace std;
int fa[550005];
int deep[550005];
int val[550005];
int get(int a){
	if(a==fa[a])
	return a;
	int root=get(fa[a]);
	val[a]=val[fa[a]]+val[a];
	deep[a]=deep[root]+val[a];
	return fa[a]=root;
}
int merge1(int x,int y){
	x=get(x);y=get(y);
	fa[x]=y;
	val[x]=3;
}
int merge2(int x,int y){
	x=get(x);y=get(y);
	fa[x]=y;
	val[x]=1;
}
int main(){
	int n,k;
	cin>>n>>k;
	int op,x,y;
	for(int i=1;i<=n;i++){
	fa[i]=i;deep[i]=0;val[i]=0;
	}
	int ans=0;
	for(int i=1;i<=k;i++){
	cin>>op>>x>>y;
	if(x>n||y>n){
ans++;
	continue;
	}
	get(x);get(y);
	if(op==1){
	if(get(x)!=get(y)){
	merge1(x,y);
	continue;
	}
	else if((deep[x]%3)!=(deep[y]%3)){
	ans++;
	continue;
	}
	}
	if(op==2){
	if(get(x)!=get(y)){
	merge2(y,x);
	continue;
	}
	else if((deep[x]%3)!=((deep[y]+1)%3)){
	ans++;
	continue;
	}
	}
	}
	cout<<ans;
	return 0;
}