#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
using namespace std;

const int N=5010,M=2*N;

int n,m,res;
int p[M];

int find(int x)
{
	if(p[x]!=x) p[x]=find(p[x]);
	return p[x];
}

int main()
{
	cin>>n>>m;
	for(int i=1;i<=M;i++) p[i]=i;
	while(m--)
	{
		char op[2];
		int a,b;
		cin>>op>>a>>b;
		if(op[0]=='E')
		{
			p[find(a+N)]=find(b);
			p[find(b+N)]=find(a);
		}
		else 
		{
			p[find(a)]=find(b);
		}
	}
	for(int i=1;i<=n;i++) 
		if(p[i]==i) res++;
	cout<<res; 
 	return 0;
}