#include<bits/stdc++.h>

namespace IO
{
	template<typename Type>
	void read(Type &x){
		char ch=getchar();
		x=0;bool f=0;
		while(ch<'0'||ch>'9')
			f|=(ch=='-'),ch=getchar();
		while(ch>='0'&&ch<='9')
			x=((x<<1)+(x<<3)+(ch^48)),ch=getchar();
		x=f?-x:x;
	}
}

using namespace std;

#define N 100005

int n,m,u,v,pos,idx1,idx2;
int head[N],dfn[N],seq[N<<1],to[N],st[22][N<<1],ret[N],sum1[N],sum2[N];
char color[N],ans[N];
char op;

struct Edge
{
	int u,v,nxt;
}e[N<<1];

void addEdge(int u,int v)
{
	e[++pos]={u,v,head[u]};
	head[u]=pos;
}

void initdfs(int u,int Father)
{
	dfn[u]=++idx1;seq[++idx2]=dfn[u];ret[dfn[u]]=u;
	if(!to[u]) to[u]=idx2;
	for(int i=head[u];i;i=e[i].nxt){
		int v=e[i].v;
		if(v==Father) continue ;
		sum1[v]=sum1[u]+(color[v]=='H');
		sum2[v]=sum2[u]+(color[v]=='G');
		initdfs(v,u);
		seq[++idx2]=dfn[u];
	}
}

void init()
{
	for(int i=1;i<=idx2;i++)
		st[0][i]=seq[i];
	for(int t=1;(1<<t)<=idx2;t++)
		for(int i=1;i+(1<<t)<=idx2;i++)
			st[t][i]=min(st[t-1][i],st[t-1][i+(1<<(t-1))]);
}

int LCA(int u,int v)
{
	int L=to[u],R=to[v];
	if(L>R) swap(L,R);
	int t=__lg(R-L+1);
	return min(st[t][L],st[t][R-(1<<t)+1]);
}

int dist1(int u,int v)
{
	return sum1[u]+sum1[v]-2*sum1[LCA(u,v)]+(color[LCA(u,v)]=='H');
}

int dist2(int u,int v)
{
	return sum2[u]+sum2[v]-2*sum2[LCA(u,v)]+(color[LCA(u,v)]=='G');
}

int main()
{
	IO::read(n);IO::read(m);
	scanf("%s",color+1);
	for(int i=1;i<n;i++){
		IO::read(u);IO::read(v);
		addEdge(u,v);
		addEdge(v,u);
	}
	initdfs(1,0);
	init();
	for(int i=1;i<=m;i++){
		IO::read(u);IO::read(v);
//		printf("%d\n",LCA(u,v));
		scanf("%s",&op);
		if(op=='H') ans[i]=(dist1(u,v))?'1':'0';
		else ans[i]=(dist2(u,v))?'1':'0';
	}
	printf("%s",ans+1);
}