#include<cstdio>#include<cmath>#include<cstring>#include<iostream>#include<vector>#include<map>#include<algorithm>using namespace std;#define maxn 100010#define ll long long#define rep(i,l,r,step) for(int i=l;i<=r;i+=step)#define down(i,l,r,step) for(int i=l;i>=r;i-=step)int n,q,t[maxn],l[maxn],r[maxn],cnt; bool f[maxn];//tree_array#define lowbit(x) x&-xint add(int x,int c){	rep(i,x,n,lowbit(i))		t[i]+=c;}int sum(int x){	int ans=0;	down(i,x,1,lowbit(i))		ans+=t[i];	return ans;}int edge,to[maxn*2],next[maxn*2],head[maxn];//邻接表void insert(int u,int v){	to[++edge]=v;	next[edge]=head[u];	head[u]=edge;} //dfs序void dfs(int rt,int fa){	l[rt]=++cnt;	add(l[rt],1);	for(int i=head[rt];i;i=next[i]){		if(to[i]!=fa) dfs(to[i],rt);	}	r[rt]=cnt;} int main(){	memset(f,1,sizeof(f));	scanf("%d",&n);	rep(i,1,n-1,1){		int x,y;		scanf("%d%d",&x,&y);		insert(x,y);		insert(y,x);	}	dfs(1,0);	scanf("%d",&q);	while(q--){		char op[10];int x;		scanf("%s%d",op,&x);		if(op[0]==‘Q‘)			printf("%d\n",sum(r[x])-sum(l[x]-1));		else{			if(f[x]){				f[x]=0;add(l[x],-1);			}			else{				f[x]=1;add(l[x],1);			}		}	}	return 0;}