// Problem: P3384 【模板】重链剖分/树链剖分
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P3384
// Memory Limit: 128 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)
// https://www.cnblogs.com/ThySecret/p/18524700

#include <bits/stdc++.h>

using namespace std;

// #define int long long
#define DEBUG
#define lc u << 1
#define rc u << 1 | 1
#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 = 2e5 + 10, M = N << 1;
const int INF = 0x3f3f3f3f;

int n, m, root, mod;
int h[N], e[M], ne[M], idx;
int a[N], val[N];
int depth[N], sz[N], hson[N];
int dfn[N], timestamp;
int top[N], id[N], s[N], fa[N];

struct Tree
{
	struct Node
	{
		int l, r, sum[2];
		inline int len() {return r - l + 1; }
	} tr[N << 2];
	
	void pushup(int u) 
	{
		tr[u].sum[0] = (tr[lc].sum[0] || tr[rc].sum[0]);
		tr[u].sum[1] = (tr[lc].sum[1] || tr[rc].sum[1]);
	}
	
	void build(int u, int l, int r)
	{
		tr[u].l = l, tr[u].r = r;
		if (l == r) return tr[u].sum[val[l]] = true, void(0);
		int mid = l + r >> 1;
		build(lc, l, mid), build(rc, mid + 1, r);
		pushup(u);
	}
	
	bool query(int u, int l, int r, bool op)
	{
		if (l <= tr[u].l && tr[u].r <= r)
			return tr[u].sum[op];
		int mid = tr[u].l + tr[u].r >> 1, res = 0;
		if (l <= mid) res |= query(lc, l, r, op);
		if (r > mid) res |= query(rc, l, r, op);
		return res;
	}
} SGT;

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

void dfs1(int ver, int pre, int deep)
{
	depth[ver] = deep, fa[ver] = pre, sz[ver] = 1;
	int maxn = -1;
	for (int i = h[ver]; ~i; i = ne[i])
	{
		int j = e[i];
		if (j == pre) continue;
		dfs1(j, ver, deep + 1);
		sz[ver] += sz[j];
		if (maxn == -1 || maxn < sz[j]) maxn = sz[j], hson[ver] = j;
	}
}

void dfs2(int ver, int topf)
{
	dfn[ver] = ++ timestamp, val[timestamp] = a[ver], top[ver] = topf;
	if (!hson[ver]) return;
	dfs2(hson[ver], topf);
	
	for (int i = h[ver]; ~i; i = ne[i])
	{
		int j = e[i];
		if (j == fa[ver] || j == hson[ver]) continue;
		dfs2(j, j);
	}
}

inline bool query_range(int x, int y, bool op)
{
	bool res = 0;
	while (top[x] != top[y])
	{
		if (depth[top[x]] < depth[top[y]]) swap(x, y);
		res |= SGT.query(1, dfn[top[x]], dfn[x], op);
		x = fa[top[x]];
	}
	
	if (depth[x] > depth[y]) swap(x, y);
	res |= SGT.query(1, dfn[x], dfn[y], op);
	return res;
}

int find(int x)
{
	if(x == fa[x]) return x;
	else return fa[x] = find(fa[x]);
}

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	// memset(h, -1, sizeof h);
	// cin >> n >> m;
	// // for (int i = 1; i <= n; i ++) cin >> a[i];
	// for(int i = 1; i <= n; i ++)
	// {
		// char ch; cin >> ch;
		// a[i] = (ch == 'H');
	// }
	// for (int i = 1; i < n; i ++)
	// {
		// int u, v; cin >> u >> v;
		// add(u, v), add(v, u);
	// }
// 	
	// dfs1(root, 0, 1);
	// dfs2(root, root);
	// SGT.build(1, 1, n);
// 	
	// while (m --)
	// {
		// int x, y; char op; cin >> x >> y >> op;
		// cout << query_range(x, y, op == 'H');
	// }
	cin >> n >> m;
	for(int i = 1; i <= n; i ++)
	{
		char ch; cin >> ch;
		fa[i] = i, s[i] = (ch == 'H');
	}
	for(int i = 1; i < n; i ++)
	{
		int u, v; cin >> u >> v;
		int fu = find(u), fv = find(v); 
		if(fu > fv) swap(fu, fv);
		if(s[fu] == s[fv]) fa[fv] = fu;
	}
	while(m --)
	{
		int l, r; char op; cin >> l >> r >> op;
		bool flag = (op == 'H');
		if(find(l) == find(r) && s[find(l)] ^ flag) cout << 0;
		else cout << 1;
	}
	return 0;
}