#include <bits/stdc++.h>
#define R(x) x = read()
#define ENDL push('\n');
#define SPACE push(' ');
#define int long long
using namespace std;
char pbuf[1<<20], *pp=pbuf;
inline void push(const char &c) {
	if(pp - pbuf == 1<<20)fwrite(pbuf, 1, 1<<20, stdout),pp = pbuf;
	*pp++ = c;
}
class io {public:~io() {fwrite(pbuf, 1, pp - pbuf, stdout);}} _;
inline void write(int x) {
	if (x<0)x=-x,push('-');
	int sta[35],top=0;
	do {
		sta[top++]=x%10,x/=10;
	} while (x);
	while(top)push(sta[--top]^'0');
}
inline int read() {
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
    while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
    return x*f;
}
int c,t,n,m;
int f[200100];
char ch;
int a,b;
int find(int x){
	while(x^f[x])x=f[x]=f[f[x]];
	return x;
}
signed main(){
//#ifndef LOCAL
//	freopen("tribool.in","r",stdin);
//	freopen("tribool.out","w",stdout);
//#endif
	R(c);R(t);
	while(t--){
		R(n);R(m);
		for(int i=1;i<=2*n+3;i++){
			f[i]=i;
		}
		for(int i=1;i<=m;i++){
			cin >> ch;
			R(a);
			switch(ch){
				case 'T':{
					f[a]=2*n+1;
					f[a+n]=2*n+2;
					break;
				}
				case 'F':{
					f[a]=2*n+2;
					f[a+n]=2*n+1;
					break;
				}
				case 'U':{
					f[a]=f[a+n]=2*n+3;
					break;
				}
				case '+':{
					R(b);
					f[a]=f[b];
					f[a+n]=f[b+n];
					break;
				}
				case '-':{
					R(b);
					f[a]=f[b+n];
					f[a+n]=f[b];
					break;
				}
			}
		}
		int res=0;
		for(int i=1;i<=n;i++){
			if(find(i)==2*n+3||find(i)==find(i+n))res++;
		}
		write(res);push('\n');
	}
    return 0;
}