#include<cstdio>

using namespace std;

const int maxn=1010<<1;

int n,m,ans;

int f[maxn];

char ch[10];

int find(int x){return x==f[x]?x:(f[x]=find(f[x]));}

void merge(int x,int y) {int xx=find(x),yy=find(y);f[xx]=yy;}

int main(){

	scanf("%d%d",&n,&m);

	for(int i=1;i<=n;i++)f[i]=i,f[i+n]=i+n;

	for (int i=0;i<m;i++){

		int a,b;

		scanf("%s%d%d",ch,&a,&b);

		if (ch[0]=='F'){

			int x=find(a),y=find(b);

			if (x!=y)f[x]=f[y];

		}else if (ch[0]=='E'){

			int x=find(a),y=find(b),z=find(a+n),w=find(b+n);

			if (x!=w)f[w]=f[x];

			if (y!=z)f[z]=f[y];

		}

	}

	for (int i=1;i<=n;i++)ans+=(f[i]==i);

	printf("%d\n",ans);

	return 0;

}