#include<bits/stdc++.h>
#define TURE -1
#define FLASE -2
#define UNKNOWN -3
using namespace std;
int t,c,n,m,fa[100001],size[100001],mp[100001];
int dfs(int x){
	if(x==fa[x]){
		return x;
	} 
	return fa[x]=dfs(fa[x]);
}
void unknown(int x,int y){
	int fx=dfs(x),fy=dfs(y);
	if(fx!=fy){
		fa[fy]=fx,size[fx]+=size[fy];
	}
}
int qufan(int x){
	if(x==TURE){
    x=FLASE;
	}
	if(x==FLASE){
	x=TURE; 
	}
	if(x==UNKNOWN){
	x=UNKNOWN;
	}
	return x^1;
}
int main(){
	cin>>c>>t;
	while(t--){
		int ans=0;
		cin>>n>>m;
		for(int i=1;i<=n;i++){
		    mp[i]=i*2,fa[i]=i,size[i]=1;
		} 
		for(int i=1;i<=m;i++){
			char opt;
			int x,y;
			cin>>opt;
			if(opt=='+'){
				cin>>x>>y;
				mp[x]=mp[y];
			}
			else if(opt=='-'){
				cin>>x>>y;
				mp[x]=qufan(mp[y]);
			}
			else if(opt=='T'){
				cin>>x;
				mp[x]=TURE;
			}
			else if(opt=='F'){
				cin>>x;
				mp[x]=FLASE;
			}
			else{
				cin>>x;
				mp[x]=UNKNOWN;
			}
			for(int i=1;i<=n;n++){
				if(mp[i]>0){
			     unknown(mp[i]/2,i);	
				}
			} 
			for(int i=1;i<=n;i++){
				if(i==dfs(i)&&(mp[i]==UNKNOWN||mp[i]==i*2+1)){
				    ans+=size[i];
				}
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}