#include<bits/stdc++.h>
using namespace std;
int fa[10000],d[10000];
int find(int x){
if(fa[x]!=x)fa[x]=find(fa[x]);
return fa[x];
}
void Union(int x,int y){
x=find(x);y=find(y);
if (x==y) return ;
fa[y]=x;
}
int main(){
  int n,m,e=0,x,y;char t;
 cin>>n>>m;
for(int i=1;i<=n;i++)fa[i]=i;
for(int i=1;i<=m;i++){
  cin>>t>>x>>y;
  if (t=='F') Union(x,y);
else {
if (d[x]==0)
d[x]=find(y);
else Union (y,d[x]);
if (d[y]==0)
d[y]=find(x);
else Union (x,d[y]);}}
for (int i=1;i<=n;i++)
{if (fa[i]=i)
e+=1;}
cout<<e;

  return 0;
}