#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int LOG = 17;
const int N = 1 << LOG;

VI g[N];
int par[LOG][N];
int tin[N], tout[N];
int d[N];
int t = 0;

void dfs(int v, int p)
{
	par[0][v] = p;
	FOR(i, 1, LOG)
		par[i][v] = par[i - 1][par[i - 1][v]];
	tin[v] = t++;
	
	for(int to : g[v])
		if(to != p)
		{
			d[to] = d[v] + 1;
			dfs(to, v);
		}
	
	tout[v] = t++;		
}

bool isParent(int v, int p)
{
	return tin[p] <= tin[v] && tout[v] <= tout[p];
}
int lca(int a, int b)
{
	if(isParent(a, b))
		return b;
	RFOR(i, LOG, 0)
	{
		if(!isParent(a, par[i][b]))
			b = par[i][b];
	}
	return par[0][b];
}

int ans[N];
set<PII> vals[N];
int color[N];

bool checkSubTree(int v, int col)
{
	auto it = vals[col].lower_bound({tin[v], -1});
	
	return (it != vals[col].end() && it->F < tout[v]);
}
void add(int v)
{
	int c = color[v];
	if(SZ(vals[c]) == 0)
	{
		vals[c].insert(MP(tin[v], v));
		return;
	}
	if(!checkSubTree(v, c))
	{
		int ver = v;
		//cerr << "up ";
		RFOR(i, LOG, 0)
		{
			if(!checkSubTree(par[i][ver], c))
			{
				ans[c] += 1 << i;
				ver = par[i][ver];
			//	cerr << i << " ";
			}
		}
		//cerr << "\n";
		//cerr << v << " " << par[0][ver] << "\n";
		ans[c]++;
	}
	
	int oldLCA = lca(vals[c].begin()->S, vals[c].rbegin()->S);
	vals[c].insert(MP(tin[v], v));
	int newLCA = lca(vals[c].begin()->S, vals[c].rbegin()->S);
	ans[c] += d[oldLCA] - d[newLCA];	
}
void remove(int v)
{
	int c = color[v];
	
	int newLCA = lca(vals[c].begin()->S, vals[c].rbegin()->S);
	vals[c].erase(MP(tin[v], v));
	
	if(SZ(vals[c]) == 0)
	{
		return;
	}
	if(!checkSubTree(v, c))
	{
		int ver = v;
		RFOR(i, LOG, 0)
		{
			if(!checkSubTree(par[i][ver], c))
			{
				ans[c] -= 1 << i;
				ver = par[i][ver];
			}
		}
		ans[c]--;
	}
	
	int oldLCA = lca(vals[c].begin()->S, vals[c].rbegin()->S);
	ans[c] -= d[oldLCA] - d[newLCA];	
}


int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	FOR(i, 0, n - 1)
	{
		int a, b;
		cin >> a >> b;
		a--; b--;
		g[a].PB(b);
		g[b].PB(a);
	}
	dfs(0, 0);
	FOR(i, 0, n)
	{
		cin >> color[i];
		add(i);
		//cerr << ans[color[i]] << "\n";
	}
	//cerr << "\n";
	int m;
	cin >> m;
	while(m--)
	{
		char x;
		cin >> x;
		if(x == 'Q')
		{
			int c;
			cin >> c;
			
			if(SZ(vals[c]) != 0)	
				cout << ans[c] << "\n";
			else
				cout << "-1\n";
		}
		else
		{
			int v;
			cin >> v;
			v--;
			remove(v);
			cin >> color[v];
			add(v);
		}
	}
	
	
	
	return 0;
}