#include<bits/stdc++.h>
using namespace std;
constexpr int N=1e5+7;
int fa[N];
int n,m;
int find(int x){
	if(fa[x]==x){
		return fa[x];
	}
	fa[x]=find(fa[x]);
	return fa[x];
}
int main() {
	cin>>n>>m;
	for(int i=1;i<=n*2;i++){
		fa[i]=i;
	}
	while(m--){
		char op;int x,y;cin>>op>>x>>y;
		if(op=='F'){
			int rx=find(x),ry=find(y);
			fa[rx]=ry;
		}else{
			int rx=find(x),ry=find(y);
			fa[x+n]=ry;
			fa[y+n]=rx;
		}
	}
	int ans=0;
	for(int i=1;i<=n;i++){
		if(fa[i]==i)ans++;
	}
	cout<<ans;
	return 0;
}

60pts 求助