#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m, fa[N][25], dep[N], cnt[N][25][2];
char c[N];
struct edge
{
	int ed, next;
}b[N << 1];
int nbs[N], tot;
void add(int u, int v)
{
	b[++ tot] = {v, nbs[u]}, nbs[u] = tot;
}
void dfs(int x, int f)
{
	fa[x][0] = f, dep[x] = dep[f] + 1;
	if (c[x] == 'H') cnt[x][0][0] ++;
	else cnt[x][0][1] ++;
	for (int i = nbs[x]; i; i = b[i].next)
	{
		int j = b[i].ed;
		if (j == f) continue;
		dfs(j, x);
	}
	for (int i = 1; i <= 25; i ++ )
	{
		fa[x][i] = fa[fa[x][i - 1]][i - 1];
		cnt[x][i][0] = cnt[x][i - 1][0] + cnt[fa[x][i - 1]][i - 1][0];
		cnt[x][i][1] = cnt[x][i - 1][1] + cnt[fa[x][i - 1]][i - 1][1];
	}
}
int lca(int x, int y, int color)
{
	int res = 0;
	if (dep[x] < dep[y]) swap(x, y);
	for (int i = 25; i >= 0; i -- )
		if (dep[fa[x][i]] >= dep[y])
			res += cnt[x][i][color], x = fa[x][i];
	if (x == y) return res;
	for (int i = 25; i >= 0; i -- )
		if (fa[x][i] != fa[y][i])
			res += cnt[x][i][color] + cnt[y][i][color], x = fa[x][i], y = fa[y][i];
	return res + cnt[x][0][color] + cnt[y][0][color];
}
int main()
{
	string ans;
	cin >> n >> m;
	for (int i = 1; i <= n; i ++ )
		cin >> c[i];
	for (int i = 1; i < n; i ++ )
	{
		int u, v;
		cin >> u >> v;
		add(u, v), add(v, u);
	}
	dfs(1, 1);
	while (m -- )
	{
		int x, y;
		char color;
		cin >> x >> y >> color;
		int tot = lca(x, y, color == 'H' ? 0 : 1);
		if (tot > 0) ans += '1';
		else ans += '0';
	}
	cout << ans;
	return 0;
}