#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,m;
int col[200005],dep[200005];
vector<int>p[200005];
int lca[100005][18],ok1[100005][18],ok2[100005][18];
void dfs(int now,int fa){
	lca[now][0] = fa;dep[now] = dep[fa]+1;
	ok1[now][0] = (col[now] == 1)|(col[fa] ==1);
	ok2[now][0] = (col[now] == 2)|(col[fa] ==2);
	for(int i = 1;i<18;i++){
		lca[now][i] = lca[lca[now][i-1]][i-1];
		ok1[now][i] = ok1[now][i-1]|ok1[lca[now][i-1]][i-1];
		ok2[now][i] = ok2[now][i-1]|ok2[lca[now][i-1]][i-1];
	}
	for(int i =0;i<p[now].size();i++){
		if(p[now][i] == fa)continue;
		dfs(p[now][i],now);
	}
}bool query1(int x,int y){
	if(x == y)return col[x] == 1;
	int ok = 0;
	if(dep[x]<dep[y])swap(x,y);
	int dis = dep[x]-dep[y];
	for(int i = 0;dis;dis>>=1,i++){
		if(dis&1)ok|=ok1[x][i],x = lca[x][i];
	}if(x == y)return ok;
	for(int i = 17;i>=0;i--){
		if(lca[y][i]!=lca[x][i]){
			ok|=ok1[x][i]|ok1[y][i];
			x = lca[x][i],y = lca[y][i];
		}
	}return ok|ok1[x][0]|ok1[y][0];
}bool query2(int x,int y){
	if(x == y)return col[x] == 2;
	int ok = 0;
	if(dep[x]<dep[y])swap(x,y);
	int dis = dep[x]-dep[y];
	for(int i = 0;dis;dis>>=1,i++){
		if(dis&1)ok|=ok2[x][i],x = lca[x][i];
	}if(x == y)return ok;
	for(int i = 17;i>=0;i--){
		if(lca[y][i]!=lca[x][i]){
			ok|=ok2[x][i]|ok2[y][i];
			x = lca[x][i],y = lca[y][i];
		}
	}return ok|ok2[x][0]|ok2[y][0];
}
signed main(){
	cin >> n >> m;
	for(int i = 1;i<=n;i++){
		char c;cin >> c;
		if(c == 'H')col[i] = 1;
		else col[i] = 2;
	}for(int i = 1;i<n;i++){
		int x,y;cin >> x >> y;
		p[x].push_back(y),p[y].push_back(x);
	}dfs(1,1);
	for(int i = 1;i<=m;i++){
		int x,y;char c;cin>>  x>> y>>c;
		if(c == 'H'){
			int res = query1(x,y);
			if(res)cout << 1;
			else cout << 0;
		}else{
			int res = query2(x,y);
			if(res)cout << 1;
			else cout << 0;
		}
	}
	return 0;
}