#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cassert>
#include<map>
using namespace std;
const int N = 1e5 + 5;

char color[N];

struct UnionFind
{
	private:
	int n;
	vector<int> par,siz;

	public:
	UnionFind(int n) :n(n),par(n,-1),siz(n,1) {}

	int root(int u)
	{
		assert(0 <= u && u < n);
		return (par[u] < 0 ? u:par[u] = root(par[u]));
	}

	bool same(int u,int v)
	{
		assert(0 <= u && u < n && 0 <= v && v < n);
		return root(u) == root(v);
	}

	bool merge(int u,int v)
	{
		assert(0 <= u && u < n && 0 <= v && v < n);
		u = root(u),v = root(v);
		if(u == v) return false;

		if(siz[u] < siz[v]) swap(u,v);

		siz[u] += siz[v];
		par[v] = u;

		return true;
	}

	int size(int u)
	{
		assert(0 <= u && u < n);
		return siz[root(u)];
	}

	vector<vector<int>> components()
	{
		vector<vector<int>> ret(n);
		for(int u = 0;u < n;u++) ret[root(u)].push_back(u);

		ret.erase(remove_if(ret.begin(),ret.end(),[](vector<int> v) { return v.empty();}),ret.end());

		return ret;
	}
};

void solve(){
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> color[i];
    }
    UnionFind dsu(N);
    for(int i = 1; i < n; i++){
        int u, v;
        cin >> u >> v;
        if(color[u] == color[v]) dsu.merge(u, v);
    }
    for(int i = 1; i <= m; i++){
        int x, y;
        char c;
        cin >> x >> y >> c;
        if(dsu.same(x, y)) cout << 0 + (color[x] == color[y]);
        else cout << 1;
    }
}

int main(){
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}