/**************************************************************

     Problem: 1103

     User: Tunix

     Language: C++

     Result: Accepted

     Time:3884 ms

     Memory:10060 kb

 ****************************************************************/

 //BZOJ 1103

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<algorithm>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 #define D(i,j,n) for(int i=j;i>=n;--i)

 #define pb push_back

 using namespace std;

 void read(int &v){

     v=; int sign=; char ch=getchar();

     while(ch<''||ch>''){ if (ch=='-') sign=-; ch=getchar();}

     while(ch>=''&&ch<=''){ v=v*+ch-''; ch=getchar();}

     v*=sign;

 }

 #define debug

 /******************tamplate*********************/

 const int N=;

 int head[N],to[N],next[N],cnt;

 void add(int x,int y){

     to[++cnt]=y; next[cnt]=head[x]; head[x]=cnt;

 }

 /********************edge**********************/

 int n,m,dfs_clock,t[N*],l[N],r[N];

 inline int lowbit(int x){return x&(-x);}

 void update(int x,int val){

     for(int i=x;i<=n*;i+=lowbit(i))

         t[i]+=val;

 }

 int sum(int x){

     int temp=;

 //  for(int i=1;i<=x;++i) temp+=t[i];

     for(int i=x;i;i-=lowbit(i)) temp+=t[i];

     return temp;

 }

 int fa[N],st[N],top=;

 void dfs(){

     st[++top]=;

     while(top){

         int x=st[top];

         if (!l[x]){

             l[x]=++dfs_clock;

             for(int i=head[x];i;i=next[i])

                 st[++top]=to[i];

         }

         else{

             r[x]=++dfs_clock;

             top--;

         }

     }

 }

 int main(){

     read(n);

     int x,y;

     F(i,,n){

         read(x); read(y);

         add(x,y);

     }

     dfs();

     memset(t,,sizeof t);

     F(i,,n) {update(l[i],); update(r[i],-);}

     char cmd[];

     read(m);

     F(i,,n+m-){

         scanf("%s",cmd);

         if (cmd[]=='A'){

             read(x); read(y);

             update(l[y],-) ;update(r[y],);

         }

         else{

             read(x);

             printf("%d\n",sum(l[x]));

         }

     }

     return ;

 }