// Skyqwq
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> void inline read(T &x) {
	x = 0; int f = 1; char s = getchar();
	while (s < '0' || s > '9') { if (s == '-') { f = -1; } s = getchar(); }
	while (s >= '0' && s <= '9') x = x * 10 + (s ^ 48), s = getchar();
	x *= f;
}

template <typename T> bool inline chkMin(T &x, T y) { return y < x ? x = y, 1 : 0; }
template <typename T> bool inline chkMax(T &x, T y) { return y > x ? x = y, 1 : 0; }

const int N = 3e4 + 5, M = 128, P = 10007;

int n, m, w[N], A[M];

vector<int> g[N];

int mod(int x) {
	return x >= P ? x - P : x;
}

void add(int &x, int y) {
	x += y;
	if (x >= P) x -= P;
}

int inv2 = (P + 1) / 2;

void inline XOR(int a[], int o) {
	for (int w = 1; w < m; w <<= 1) 
		for (int i = 0; i < m; i += (w << 1)) 
			for (int j = 0; j < w; j++) {
				int u = a[i + j], v = a[i + j + w];
				a[i + j] = (u + v + P) * o % P;
				a[i + j + w] = (u - v + P) * o % P;
			}
}


struct E{
	int w[M];
	E inline operator + (const E &b) const {
		E c; memset(c.w, 0, sizeof c.w);
		for (int i = 0; i < m; i++)
			c.w[i] = mod(w[i] + b.w[i]);
		return c;
	}
	E inline operator - (const E &b) const {
		E c; memset(c.w, 0, sizeof c.w);
		for (int i = 0; i < m; i++)
			c.w[i] = mod(w[i] - b.w[i] + P);
		return c;
	}
	E inline operator * (const E &b) const {
		E c; memset(c.w, 0, sizeof c.w);
		for (int i = 0; i < m; i++)
			c.w[i] = w[i] * b.w[i] % P;
		return c;
	}
	void inline out() {
		for (int i = 0; i < m; i++) cerr << w[i] << " ";
		cout << endl;
	}
	E bh() {
		E v;
		for (int i = 0; i < m; i++) v.w[i] = w[i];
		XOR(v.w, inv2);
		return v;
	}
	void inline bhout() {
		for (int i = 0; i < m; i++) A[i] = w[i];
		XOR(A, inv2);
		for (int i = 0; i < m; i++) cerr << A[i] << " ";
		cerr << endl;
	}
} dw, W[N], res, la[N], rel;

int fa[N], sz[N], son[N], d[N];

struct Mat{
	E pr, sf, sm, ans;
	Mat operator * (const Mat &b) const {
		Mat c;
		c.sm = sm * b.sm;
		c.ans = ans + b.ans;
		c.ans = c.ans + sf * b.pr;
		c.pr = pr + sm * b.pr;
		c.sf = b.sf + b.sm * sf;
		return c;
	}
};

void dfs1(int u) {
	sz[u] = 1;
	for (int v: g[u]) {
		if (v == fa[u]) continue;
		fa[v] = u;
		d[v] = d[u] + 1;
		dfs1(v);
		sz[u] += sz[v];
		if (sz[v] > sz[son[u]]) son[u] = v;
	}
}

int len, b[N], val[N], rt[N], ps[N];

struct T{
	int l, r, f;
	Mat v, s;
} t[N << 1];

int inline getM(int x, int y) {
	int mn = 2e9, p = -1;
	for (int i = x; i <= y; i++) 
		if (chkMin(mn, max(val[i - 1] - val[x - 1], val[y] - val[i]))) p = i;
	return p;
}

#define ls t[p].l
#define rs t[p].r

void pu(int p) {
	if (ls && rs) t[p].s = t[ls].s * t[p].v * t[rs].s;
	else if (ls) t[p].s = t[ls].s * t[p].v;
	else if (rs) {
		t[p].s = t[p].v * t[rs].s;
	}
	else t[p].s = t[p].v;
	// cerr << " pu " << p << " ... " << ls << " " << rs << endl;
	// if (p == 1) {
	// 	t[p].v.ans.out();
	// 	puts("haha");
	// }
}

void inline bd(int &p, int l, int r, int F) {
	if (l > r) return;
	int mid = getM(l, r);
	p = b[mid]; 
//	cerr << p << " father is " << F << endl;
	t[p].f = F;
	bd(ls, l, mid - 1, p), bd(rs, mid + 1, r, p);
	pu(p);
}


struct Te{
	int l, r;
	E v;
} te[N << 1];

int idt;

struct Lson{
	int sz, rt;
	void inline bd(int x) {
		sz = x;
	}
	#define Ls te[p].l
	#define Rs te[p].r
	void inline pu(int p) {
		te[p].v = te[Ls].v * te[Rs].v;
	}
	void chg(int &p, int l, int r, int x, E u) {
		if (!p) p = ++idt;
		if (l == r) {
			for (int i = 0; i < m; i++) te[p].v.w[i] = mod(u.w[i] + 1);
			return;
		}
		int mid = (l + r) >> 1;
		if (x <= mid) chg(Ls, l, mid, x, u);
		else chg(Rs, mid + 1, r, x, u);
		pu(p);
	}
	void chg(int x, E u) {
		chg(rt, 0, sz - 1, x, u);
	}
	E qry() {
		if (!sz) return dw;
		return te[rt].v;
	}
} To[N];

int num[N];

void inline remake(int u) {
	E o = To[u].qry() * W[u];
	// cerr << u << " remake\n";
	// for (int i = 0; i < m; i++) cerr << o.w[i] << " ";
	// cout<< endl;
	t[u].v.sf = t[u].v.pr = t[u].v.ans = t[u].v.sm = o;
//	cerr << u << " rm " << G[u][0] << " " << G[u][1] << "awa?\n";
}

void gx(int v) {
	res = res - la[v];
	la[v] = t[rt[v]].s.ans;
	res = res + la[v];
}

void inline updF(int v) {
	assert(fa[v]);
	To[fa[v]].chg(num[v], t[rt[v]].s.pr);
}

void inline bd(int tp) {
	int x = tp; vector<int> z;
	while (x) z.pb(x), x = son[x];
	for (int u: z) {
		int now = 0;
		for (int v: g[u]) {
			if (v == fa[u] || v == son[u]) continue;
			bd(v);
			num[v] = now;
			++now;
		}
		To[u].bd(now);
		for (int v: g[u]) {
			if (v == fa[u] || v == son[u]) continue;
			updF(v);
		}
		remake(u);
	}
	
	len = 0;
	for (int v: z) b[++len] = v, val[len] = sz[v] - sz[son[v]]; //, cerr <<" " << v << "--";
//	cerr << endl;
	for (int i = 1; i <= len; i++) val[i] += val[i - 1];
	bd(rt[tp], 1, len, 0);
	ps[rt[tp]] = tp;
	//t[rt[tp]].s.sm.bhout();
	//cerr << tp << " ldwl\n";
	gx(tp);
	
}

void bh(int x) {
	for (int i = 0; i < m; i++) W[x].w[i] = 0;
	W[x].w[w[x]] = 1;
	XOR(W[x].w, 1);
	// for (int i = 0; i < m; i++) cerr << W[x].w[i] << " ";
	// cout << w[x] << " " << " v \n";
}

void inline sop(int x) {
	while (x) {
		remake(x); int p = x, y = 0;
		while (p) y = ps[p], pu(p), p = t[p].f;
		assert(y);
		gx(y);
		if (!fa[y]) break;
		updF(y), x = fa[y];
	}
}

char op[10];

int main() {
//	freopen("4.in", "r", stdin);
	read(n), read(m);
	for (int i = 0; i < m; i++) dw.w[i] = 1;
	for (int i = 1; i <= n; i++) read(w[i]), bh(i);
	for (int i = 1, u, v; i < n; i++) {
		read(u), read(v), g[u].pb(v), g[v].pb(u);
	}
	dfs1(1);
	bd(1);

	rel = res;
	XOR(rel.w, inv2); 
	// for (int i = 0; i < m; i++) cout << rel.w[i] << " ";
	// 	cout << endl;
	int q; read(q);
	while (q--) {
		scanf("%s", op);
		if (op[0] == 'Q') {
			int k; read(k);
			rel = res;
			XOR(rel.w, inv2); 
			printf("%d\n", rel.w[k]);
		} else {
			int x, y; read(x), read(y);
			w[x] = y;
			bh(x);
			sop(x); 
		}
	}
	return 0;
}