int idx = ;

void dfs(int u, int fa)

{

    seq[++idx] = u;

    in[u] = idx;

    for(int i = head[u];i;i = nxt[i])

    {

        int v = l[i];

        if(v != fa)

        {

            dfs(v, u);

        }

    }

    out[u] = idx;

}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <algorithm>

#include <queue>

using namespace std;

const int SZ = ;

const int INF = 1e9+;

int head[SZ], nxt[SZ], l[SZ], tot = ;

int in[SZ], out[SZ], seq[SZ], a[SZ];

void build(int f, int t)

{

    l[++tot] = t;

    nxt[tot] = head[f];

    head[f] = tot;

}

int idx = ;

void dfs(int u, int fa)

{

    seq[++idx] = u;

    in[u] = idx;

    for(int i = head[u];i;i = nxt[i])

    {

        int v = l[i];

        if(v != fa)

        {

            dfs(v, u);

        }

    }

    out[u] = idx;

}

int d[SZ], n;

void add(int i, int x)

{

    for(; i <= n; i += (i & -i))

        d[i] += x;

}

int get(int i)

{

    int ans = ;

    for(;i;i -= (i & -i))

        ans += d[i];

    return ans;

}

int query(int l, int r)

{

    return get(r) - get(l - );

}

int main()

{

    scanf("%d", &n);

    for(int i = ; i < n-; i++)

    {

        int x, y;

        scanf("%d %d", &x, &y);

        build(x, y);

        build(y, x);

    }

    dfs(, );

    /*for(int i = 0; i < 11; i++) printf("%d ", in[i]); printf("\n");

    for(int i = 0; i < 11; i++) printf("%d ", out[i]); printf("\n");

    for(int i = 0; i < 25; i++) printf("%d ", seq[i]); printf("\n");*/

    int m;

    scanf("%d", &m);

    for(int i = ; i <= n; i++)

        add(i, ), a[i] = ;

    while(m--)

    {

        char op;

        int x;

        scanf("%c", &op);

        scanf("%c", &op);

        scanf("%d", &x);

        if(op == 'Q')

            printf("%d\n", query(in[x], out[x]));

        if(op == 'C')

        {

            if(a[in[x]]) {a[in[x]] = ; add(in[x], -); }

            else {a[in[x]] = ; add(in[x], ); }

        }

    }

    return ;

}