#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
vector<int> e[N];
int col[N];
struct ST_LCA{
    int nods;
    int fa[N], dep[N];
    int dfn[N], clk = 0, dfnst[N][21];
    int ch[N], cg[N];
    void dfs(int u, int f){
        dfn[u] = ++clk;dfnst[clk][0] = u;
        fa[u] = f, dep[u] = dep[f] + 1;
        ch[u] = ch[f], cg[u] = cg[f];
        if(col[u] == 0) ch[u]++;
        else cg[u]++;
        for(int v : e[u]){
            if(v == f) continue;
            dfs(v, u);
        } 
    }
    void pre_st(){
        int _k = __lg(nods);
        for(int j = 1;j <= _k;j++){
            for(int i = 1;i + (1 << j) - 1 <= nods;i++){
                if(dep[dfnst[i][j - 1]] < dep[dfnst[i + (1 << (j - 1))][j - 1]]) dfnst[i][j] = dfnst[i][j - 1];
                else dfnst[i][j] = dfnst[i + (1 << (j - 1))][j - 1];   
            }
        }
    }
    void init(int nnod, int rt = 1){
        nods = nnod;
        dfs(rt, 0);
        pre_st();
    }
    int qry(int x, int y){
        int Lg = __lg(y - x + 1);
        int q = dfnst[x][Lg], p = dfnst[y - (1 << Lg) + 1][Lg];
        if(dep[q] < dep[p]) return q;
        else return p; 
    }
    int getlca(int u, int v){
        if(u == v) return u;
        if(dfn[u] > dfn[v]) swap(u, v);
        return fa[qry(dfn[u] + 1, dfn[v])];
    }
    int cnt_h(int u, int v){
        int lc = getlca(u, v);
        return ch[u] + ch[v] - ch[lc] - ch[fa[lc]];
    }
    int cnt_g(int u, int v){
        int lc = getlca(u, v);
        return cg[u] + cg[v] - cg[lc] - cg[fa[lc]];
    }
}T;
using namespace std;
int n, m;
char s[N];
int main(){
    scanf("%d%d",&n,&m);   
    scanf("%s",s + 1);
    for(int i = 1;i <= n;i++) col[i] = (s[i] == 'G') ? 1 : 0;
    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);
    }
    T.init(n);
    while(m--){
        int u, v; char ch;
        scanf("%d%d %c",&u,&v,&ch);
        if(ch == 'H'){
            if(T.cnt_h(u, v) > 0) putchar('1');
            else putchar('0');
        }
        else{
            if(T.cnt_g(u, v) > 0) putchar('1');
            else putchar('0');
        }
    }
}