#include<iostream>
#include<vector>
using namespace std;
const int N=1e3+1;
int m,n,pre[N],dp[N],cnt[N],ans;
vector<int> e[N];
void in(){
	for(int i=1;i<=n;i++){
		pre[i]=i;
		dp[i]=1;
	}
}
int find(int x){
	if(x==pre[x]) return x;
	return pre[x]=find(pre[x]);
}
void join(int x,int y){
	x=find(x);
	y=find(y);
	if(dp[x]>dp[y]){
		pre[y]=x;
		return ;
	}
	else{
		if(dp[x]==dp[y]) dp[y]++;
		pre[x]=y;
	}
}
int main(){
	cin>>n>>m;
	in();
	char x;
	int a,b;
	for(int i=1;i<=m;i++){
		cin>>x>>a>>b;
		if(x=='F'){
			if(find(a)==find(b)) continue;
			join(a,b);
		}
		else{
			e[a].push_back(b);
			e[b].push_back(a);
			for(auto v:e[a]){
				if(find(b)==find(v)) continue;
				join(b,v);
			}
		}
	}
	for(int i=1;i<=n;i++){
		if(cnt[pre[i]]) continue;
		cnt[pre[i]]=1;
		ans++;
	}
	cout<<ans;
}