#include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

const int N = 100010, M = 2 * N;

int n, m;
char cows[N];
int ans[N], cnt;
int fa[N][20], depth[N];
int h[N], e[M], ne[M], idx;

void add(int a, int b)
{
    e[idx] = b;
    ne[idx] = h[a];
    h[a] = idx;
    idx ++ ;
}

void bfs()
{
    memset(depth, 0x3f, sizeof depth);
    depth[0] = 0, depth[1] = 1;
    queue<int> q;
    q.push(1);
    
    while (q.size())
    {
        int t = q.front();
        q.pop();
        
        for (int i = h[t]; i != -1; i = ne[i])
        {
            int j = e[i];
            if (depth[j] > depth[t] + 1)
            {
                depth[j] = depth[t] + 1;
                fa[j][0] = t;
                q.push(j);
                
                for (int k = 1; k <= 16; k ++ ) fa[j][k] = fa[fa[j][k - 1]][k - 1];
            }
        }
    }
}

bool lca(int a, int b, char c)
{
    if (cows[a] == c || cows[b] == c) return true;
    if (a == b) return false;
    
    if (depth[a] < depth[b]) swap(a, b);
    
    for (int k = 16; k >= 0; k -- )
        if (depth[fa[a][k]] >= depth[b])
        {
            a = fa[a][k];
            if (cows[a] == c) return true;
        }
    
    if (a == b) return false;
    
    for (int k = 16; k >= 0; k -- )
        if (fa[a][k] != fa[b][k])
        {
            a = fa[a][k];
            b = fa[b][k];
            if (cows[a] == c || cows[b] == c) return true;
        }
    
    if (cows[fa[a][0]] == c) return true;
    
    return false;
}

int main()
{
    cin >> n >> m;
    cin >> cows + 1;
    
    memset(h, -1, sizeof h);
    for (int i = 0; i < n - 1; i ++ )
    {
        int a, b;
        scanf("%d %d", &a, &b);
        add(a, b), add(b, a);
    }
    
    bfs();
    
    for (int i = 0; i < m; i ++ )
    {
        int a, b;
        char c;
        scanf("%d %d %c", &a, &b, &c);
        if (lca(a, b, c)) ans[++ cnt] = 1;
        else ans[++ cnt] = 0;
    }
    
    for (int i = 1; i <= cnt; i ++ ) cout << ans[i];
    
    return 0;
}