#include <stdio.h>
#include <vector>
#include <cstring>
#include <cmath>
using namespace std;
int n, m;
char colors[100010];
vector<int> G[100010];
int depth[100010], fa[20][100010], cntH[100010], cntG[100010];
void dfs(int u, int p) {
    fa[0][u] = p;
    depth[u] = depth[p] + 1;
    cntH[u] = cntH[p] + (colors[u] == 'H' ? 1 : 0);
    cntG[u] = cntG[p] + (colors[u] == 'G' ? 1 : 0);
    for (int v : G[u]) {
        if (v != p) {
            dfs(v, u);
        }
    }
}
void init() {
    for (int k = 1; k < 20; k++) {
        for (int u = 1; u <= n; u++) {
            if (fa[k - 1][u] != -1) {
                fa[k][u] = fa[k - 1][fa[k - 1][u]];
            } else {
                fa[k][u] = -1;
            }
        }
    }
}
int lca(int x, int y) {
    if (depth[x] < depth[y]) swap(x, y);
    for (int k = 19; k >= 0; k--) {
        if (depth[fa[k][x]] >= depth[y]) {
            x = fa[k][x];
        }
    }
    if (x == y) return x;
    for (int k = 19; k >= 0; k--) {
        if (fa[k][x] != fa[k][y]) {
            x = fa[k][x];
            y = fa[k][y];
        }
    }
    return fa[0][x];
}
int main() {
    scanf("%d%d", &n, &m);
    scanf("%s", colors + 1);
    for (int i = 1; i < n; i++) {
        int x, y;
        scanf("%d%d", &x, &y);
        G[x].push_back(y);
        G[y].push_back(x);
    }
    memset(fa, -1, sizeof(fa));
    dfs(1, 0);
    init();
    for (int i = 0; i < m; i++) {
        int x, y;
        char t[10];
        scanf("%d%d%s", &x, &y, t);
        int ancestor = lca(x, y);
        int count_t;
        if (t[0] == 'H') {
            count_t = cntH[x] + cntH[y] - 2 * cntH[ancestor] + (colors[ancestor] == 'H' ? 1 : 0);
        } else {
            count_t = cntG[x] + cntG[y] - 2 * cntG[ancestor] + (colors[ancestor] == 'G' ? 1 : 0);
        }
        if (count_t > 0) {
            putchar('1');
        } else {
            putchar('0');
        }
    }
    return 0;
}