#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;

void fileIO()
{
    freopen("ferrari.in", "r", stdin);
    freopen("ferrari.out", "w", stdout);
}
void fastIO()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int MAXN=3005;
const int MAXQ=2e5+5;

int n,q;
string s;
vector<int> adj[MAXN];
int mark[MAXN][MAXN];
long long Ans[MAXQ];
int p[2*MAXN];
string cur;

void dfs(int v,int par,int root)
{
    cur+=s[v-1];
    if(mark[root][v]>0)
    {
        //cout<<root<<" "<<v<<" "<<mark[root][v]<<" "<<cur.size()<<endl;
        cur+=")";
        int sz=cur.size()-2;
        int l=1, r=1;
        for(int j=0;j<cur.size();j++) p[j]=0;
        p[1]=1;
        for(int j=1;j<=sz;j++)
        {
            p[j]=max(0, min(r-j+1, p[l+r-j]));
            while(cur[j - p[j]] == cur[j + p[j]]) 
            {
                p[j]++;
            }
            if(j + p[j] -1 > r)
            {
                l = j - p[j] +1;
                r = j + p[j] -1;
            }
        }
        long long ans=0;
        for(int j=1;j<=sz;j++)
        {
            ans+=p[j]/2;
        }
        Ans[mark[root][v]]=ans;

        cur.pop_back();
    }
    cur+="$";
    for(auto u: adj[v])
    {
        if(u==par) continue;
        dfs(u,v,root);
    }
    cur.pop_back();
    cur.pop_back();
}

void solve()
{
    cin>>n;
    cin>>s;
    for(int i=1;i<n;i++)
    {
        int u,v;
        cin>>u>>v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    cin>>q;
    for(int i=0;i<q;i++)
    {
        int u,v;
        cin>>u>>v;
        mark[u][v]=i+1;
    }

    for(int i=1;i<=n;i++)
    {
        cur="(";
        dfs(i,0,i);
    }

    for(int i=1;i<=q;i++) cout<<Ans[i]<<endl;
}

int main()
{
    fastIO();
    fileIO();

    solve();

    return 0;
}