#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
const int MN=1e5+5;
ll n,m,c[MN],fa[MN][25],vis[2][MN][25],head[MN],tot,deep[MN];
struct edge{ll to,nxt;}e[MN<<1];
void write(ll n){if(n<0){putchar('-');write(-n);return;}if(n>9)write(n/10);putchar(n%10+'0');}
ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
char gc(){char ch=getchar();while(ch!='H'&&ch!='G')ch=getchar();return ch;}
void add(ll u, ll v){e[++tot].nxt=head[u];head[u]=tot;e[tot].to=v;}
void lca_dfs(ll u, ll f){
    deep[u]=deep[f]+1;fa[u][0]=f;vis[c[u]][u][0]=1;
    for(int i=1; i<25; i++){
        fa[u][i]=fa[fa[u][i-1]][i-1];
        for(int j=0; j<2; j++) vis[j][u][i]=vis[j][u][i-1]|vis[j][fa[u][i-1]][i-1];
    }
    for(int i=head[u]; i; i=e[i].nxt){
        ll v=e[i].to;
        if(v==f) continue;
        lca_dfs(v,u);
    }
}
ll lca(ll x, ll y, ll op){
    ll res=0;
    if(deep[x]<deep[y]) swap(x,y);
    for(int i=24; i>=0; i--) if(deep[x]-(1<<i)>=deep[y]){
        res|=vis[op][x][i];
        x=fa[x][i];
    }
    if(x==y) return res|(c[x]==op?1:0);
    for(int i=24; i>=0; i--) if(fa[x][i]!=fa[y][i]){
        res|=vis[op][x][i];res|=vis[op][y][i];
        x=fa[x][i];y=fa[y][i];
    }
    res|=(c[fa[x][0]]==op?1:0);
    return res;
}
int main(){
    n=read();m=read();
    for(int i=1; i<=n; i++){
        char ch=gc();
        c[i]=(ch=='H'?0:1);
    }
    for(int i=1; i<n; i++){
        ll u=read(),v=read();
        add(u,v);add(v,u);
    }
    lca_dfs(1,0);
    while(m--){
        ll s=read(),t=read(),op;char ch=gc();op=(ch=='H'?0:1);
        write(lca(s,t,op)|(c[s]==op?1:0)|(c[t]==op?1:0));
    }
    return 0;
}