#include<bits/stdc++.h>
using namespace std;
const int MAXN = 5e5+10;
int cnt[MAXN];
int a[MAXN];
vector<int>e[MAXN];
int top[MAXN],dep[MAXN],fa[MAXN],siz[MAXN],son[MAXN],id[MAXN],rev[MAXN],dfn;
void dfs1(int u,int f){
    
    dep[u]=dep[f]+1;fa[u]=f;siz[u]=1;
    cnt[u]=cnt[f]+a[u];
    for(int v:e[u]){
        if(v==f)continue;
        dfs1(v,u);
        if(siz[v]>siz[son[u]])son[u]=v;
    }
}
void dfs2(int u){
    id[u]=++dfn;rev[dfn]=u;
    if(son[fa[u]]==u)top[u]=top[fa[u]];
    else top[u]=u;
    if(!son[u])return ;
    dfs2(son[u]);
    for(int v:e[u]){if(v==fa[u]||v==son[u])continue;dfs2(v);}
}
int LCA(int x,int y){
    while(top[x]!=top[y]){
        if(dep[top[x]]<dep[top[y]])swap(x,y);
        x=fa[top[x]];
    }
    if(dep[x]>dep[y])swap(x,y);
    return x;
}
typedef pair<int,int>arr;
arr Check(int x,int y){
    int lca=LCA(x,y);
    return arr(dep[x]+dep[y]-dep[lca]+1,(cnt[x]+cnt[y]-2*cnt[lca]+a[lca]));
}
int n,m;
char s[MAXN];
int main(){
    scanf("%d%d",&n,&m);
    scanf("%s",s+1);
    for(int i=1;i<=n;++i)a[i]=s[i]=='H';
    for(int i=1;i<n;++i){int u,v;scanf("%d%d",&u,&v);e[u].push_back(v),e[v].push_back(u);}
    dfs1(1,1),dfs2(1);
    while(m--){
        int x,y;char ch;cin>>x>>y>>ch;
        arr sum=Check(x,y);
        if((ch=='H'&&sum.second!=0)||(ch=='G'&&sum.second!=sum.first))putchar('1');
        else putchar('0');
    }
    return 0;
}