/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
// void write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 3e5 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 1e9 + 7;


vector<int> e[N];
void add(int a,int b){
    e[a].pb(b);
    e[b].pb(a);
}

string s;


namespace LCA{
    int fa[N][22];
    int dep[N];
    int c[N];
    void dfs(int x,int f){
        c[x]=c[f];
        if(s[x]=='H')c[x]++;
        dep[x]=dep[f]+1;
        for(auto v:e[x]){
            if(v==f)continue;
            fa[v][0]=x;
            for(int i=1;i<=20;i++){
                fa[v][i]=fa[fa[v][i-1]][i-1];
            }
            dfs(v,x);
        }
    }

    int lca(int a,int b){
        if(dep[a]<dep[b])swap(a,b);
        for(int i=20;~i;i--){
            if(dep[fa[a][i]]>=dep[b])a=fa[a][i];
        }
        if(a==b)return a;
        for(int i=20;~i;i--){
            if(fa[a][i]!=fa[b][i]){
                a=fa[a][i];
                b=fa[b][i];
            }
        }

        return fa[a][0];
    }
}using namespace LCA;



signed main() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);

    int n=rd,m=rd;
    cin>>s;
    s=" "+s;
    for(int i=1;i<n;i++){
        add(rd,rd);
    }


    dfs(1,0);


    while(m--){
        int a=rd,b=rd;
        int anc=lca(a,b);
        int g=c[a]-c[fa[anc][0]]+c[b]-c[anc];
        int l=dep[a]-dep[anc]-dep[b]-dep[anc]+1;
        char op;
        cin>>op;
        if(op=='H'){
            if(g)cout<<1;
            else cout<<1;
        }else{
            if(l-g)cout<<1;
            else cout<<0;
        }
    }



}