#include <bits/stdc++.h>

using namespace std;

const int BUFFER_SIZE = 1 << 20;
char rb[BUFFER_SIZE], *rp = rb, *rt = rb;
inline char read_char() {
    return rp == rt ? (rt = rb + fread(rb, 1, BUFFER_SIZE, stdin), rp = rb, *rp ++) : *rp ++;
}
inline int read_int() {
    int x = 0;
    char ch = read_char(), flag = 0;
    while (ch != '-' && (ch < '0' || ch > '9')) {
        ch = read_char();
    }
    if (ch == '-') {
        flag = 1;
        ch = read_char();
    }
    for (x = 0; ch >= '0' && ch <= '9'; ch = read_char()) {
        x = x * 10 + (ch - '0');
    }
    return flag ? -x : x;
}
inline int read_string(char* s) {
    char* s0 = s;
    for (char ch = read_char(); ch > ' '; ch = read_char()) {
        *s ++ = ch;
    }
    return s - s0;
}

const int MAX_N = 100000 + 5;

int N, M;
char a[MAX_N], b[5], ans[MAX_N];
int elast[MAX_N], ey[MAX_N << 1], enext[MAX_N << 1];
int fath[MAX_N], siz[MAX_N], son[MAX_N], anc[MAX_N], d[MAX_N], h[MAX_N];

void dfs_1(int u, int fa) {
    fath[u] = fa;
    siz[u] = 1;
    d[u] = d[fa] + 1;
    h[u] = h[fa] + (a[u] == 'H');
    for (int j = elast[u], v; j; j = enext[j]) {
        if ((v = ey[j]) != fa) {
            dfs_1(v, u);
            siz[u] += siz[v];
            son[u] = siz[son[u]] < siz[v] ? v : son[u];
        }
    }
}
void dfs_2(int u, int anc_) {
    anc[u] = anc_;
    if (son[u]) {
        dfs_2(son[u], anc_);
    }
    for (int j = elast[u], v; j; j = enext[j]) {
        if ((v = ey[j]) != fath[u] && v != son[u]) {
            dfs_2(v, v);
        }
    }
}
int get_lca(int u, int v) {
    while (anc[u] != anc[v]) {
        if (d[anc[u]] > d[anc[v]]) {
            u = fath[anc[u]];
        } else {
            v = fath[anc[v]];
        }
    }
    return d[u] < d[v] ? u : v;
}

int main() {
    N = read_int(), M = read_int();
    read_string(a + 1);
    for (int i = 1, j = 1; i < N; i ++) {
        int x = read_int(), y = read_int();
        ey[j] = y, enext[j] = elast[x], elast[x] = j ++;
        ey[j] = x, enext[j] = elast[y], elast[y] = j ++;
    }
    dfs_1(1, 0);
    dfs_2(1, 1);
    for (int i = 1; i <= M; i ++) {
        int x = read_int(), y = read_int(), z = get_lca(x, y);
        read_string(b);
        int t = h[x] + h[y] - h[z] - h[fath[z]];
        if (b[0] == 'H') {
            ans[i] = t ? '1' : '0';
        } else {
            int s = d[x] + d[y] - d[z] - d[fath[z]];
            ans[i] = t < s ? '1' : '0';
        }
    }
    printf("%s\n", ans + 1);
    return 0;
}