// Problem: P5836 [USACO19DEC] Milk Visits S
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P5836
// Date: 2024-04-21 09:17:10
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// 
// Programmed by ThySecret

#include <bits/stdc++.h>

using namespace std;

// #define int long long
// #define DEBUG
#define x first
#define y second
#define File(a) freopen(a".in", "r", stdin); freopen(a".out", "w", stdout)

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

const int N = 200010, M = 400010;
const int INF = 0x3f3f3f3f;

int n, m;
char s[N];
int h[N], e[M], ne[M], idx;
int depth[N], pre[N][20];
int cntH[N], cntG[N];

inline void add(int a, int b)
{
	e[++ idx] = b, ne[idx] = h[a], h[a] = idx;
}

void prework()
{
	memset(depth, 0x3f, sizeof depth);
	depth[0] = 0, depth[1] = 1;
	queue<int> q;
	q.push(1);
	
	while (!q.empty())
	{
		int ver = q.front(); q.pop();
		
		if (s[ver] == 'H') cntH[ver] = cntH[pre[ver][0]] + 1;
		else cntH[ver] = cntH[pre[ver][0]];
		if (s[ver] == 'G') cntG[ver] = cntG[pre[ver][0]] + 1;
		else cntG[ver] = cntG[pre[ver][0]];
		
		for (int i = h[ver]; ~i; i = ne[i])
		{
			int j = e[i];
			if (depth[j] > depth[ver] + 1)
			{
				depth[j] =  depth[ver] + 1;
				q.push(j);
				
				pre[j][0] = ver;
				for (int k = 1; k <= 19; k ++)
					pre[j][k] = pre[pre[j][k - 1]][k - 1];
			}
		}
	}
}

int lca(int a, int b)
{
	if (depth[a] < depth[b]) swap(a, b);
	
	for (int k = 19; k >= 0; k --)
		if (depth[pre[a][k]] >= depth[b])
			a = pre[a][k];
			
	if (a == b) return a;

	for (int k = 19; k >= 0; k --)
		if (pre[a][k] != pre[b][k])
			a = pre[a][k], b = pre[b][k];
	
	return pre[a][0];
}

signed main()
{
	// ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	memset(h, -1, sizeof h);
	cin >> n >> m;
	cin >> s + 1;
	for (int i = 1; i < n; i ++)
	{
		int a, b; cin >> a >> b;
		add(a, b), add(b, a);
	}
	
	prework();
	
	#ifdef DEBUG
	// for (int i = 1; i <= n; i ++)
		// cout << cntH[i] << ' ' << cntG[i] << '\n';
	#endif
	
	while (m --)
	{
		int a, b; cin >> a >> b;
		char str; cin >> str;
		int p = lca(a, b);
		// cout << p << '\n';
		if (str == 'H')
		{
			int tmp = cntH[a] + cntH[b] - 2 * cntH[p] + (s[p] == 'H');
			if (tmp) cout << 1;
			else cout << 0;
		}
		else
		{
			int tmp = cntG[a] + cntG[b] - 2 * cntG[p] + (s[p] == 'G');
			if (tmp) cout << 1;
			else cout << 0;
		}
	}
	
	return 0;
}