#include<bits/stdc++.h>
using namespace std;
struct edge {
	int v, nxt;
} a[200005];
int n, m, fa[100005][25], s, cnt, d[100005], sum[100005][25], num[100005], ans, dis;
int head[100005];
void add(int p, int q) {
	a[++cnt].nxt = head[p];
	head[p] = cnt;
	a[cnt].v = q;
}
void dfs(int q) {
	sum[q][0] = num[q];
	for (int i = 1; (1 << i) + 1 <= d[q]; i++) {
		fa[q][i] = fa[fa[q][i - 1]][i - 1];
		sum[q][i] = sum[q][i - 1] + sum[fa[q][i - 1]][i - 1];
	}
	for (int i = head[q]; i; i = a[i].nxt) {
		if (d[a[i].v]) continue;
		fa[a[i].v][0] = q;
		d[a[i].v] = d[q] + 1;
		dfs(a[i].v);
	}
}
int lca(int p, int q) {
	if (d[q] > d[p]) swap(p, q);
	ans = dis = 0;
//	cout << p << " " << q << " " << dis << ' ' << ans << d[p] << ' ' << d[q] << endl;
	for (int i = 20; i >= 0; i--) {
		if (d[p] - (1 << i) >= d[q]) {
			ans += sum[p][i];
			p = fa[p][i];
			dis += (1 << i);
		}
	}
//	cout << p << " " << q << " " << dis << ' ' << ans << endl;
	dis++;
	ans += sum[p][0];
	if (p == q) return p;
//	cout << p << " " << q << " " << dis << ' ' << ans << endl;
	for (int i = 20; i >= 0; i--) {
		if (fa[q][i] != fa[p][i]) {
			ans += sum[q][i] + sum[p][i];
			q = fa[q][i];
			dis += 2 * (1 << i);
			p = fa[p][i];
		}
	}
	dis += 3;
	ans += sum[p][0] + sum[q][0] + sum[fa[p][0]][0];
	return fa[p][0];
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	int p, q;
	char c;
	for (int i = 1; i <= n; i++) {
		cin >> c;
		if (c == 'G') num[i] = 1;
	}
	for (int i = 1; i < n; i++) {
		cin >> p >> q;
		add(p, q);
		add(q, p);
	}
	d[1] = 1;
	dfs(1);
	for (int i = 1; i <= m; i++) {
		cin >> p >> q >> c;
		lca(p, q);
//		cout << ans << "|" << dis << endl;
		if (c == 'H') {
			if (dis == ans) {
				cout << 0;
			} else {
				cout << 1;
			}
		} else {
			if (ans == 0) {
				cout << 0;
			} else {
				cout << 1;
			}
		}
	}
	return 0;
}