#include<cstdio>#include<algorithm>#include<cmath>using namespace std;int Num,CH[12],f,c;inline void R(int &x){    c=0;f=1;    for(;c<‘0‘||c>‘9‘;c=getchar())if(c==‘-‘)f=-1;    for(x=0;c>=‘0‘&&c<=‘9‘;c=getchar())(x*=10)+=(c-‘0‘);    x*=f;}inline void P(int x){    if(x<10)putchar(x+‘0‘);    else{P(x/10);putchar(x%10+‘0‘);}}#define maxn 100001int num[maxn],num2[maxn],l[maxn],sum=1,b[maxn],w[maxn],now,from,to;int es,n,m,v[200001],first[maxn],next[200001],a[maxn],ma[maxn],en,cnts[maxn];int Lt[maxn],Rt[maxn],X,K,anss[maxn],fdfn[maxn];bool vis[100001];struct Point{int v,p;}t[maxn];struct Ask{int l,r,k,p;}Q[10001];bool operator < (const Point &a,const Point &b){return a.v<b.v;}bool operator < (const Ask &a,const Ask &b){return num2[a.l]!=num2[b.l] ? num2[a.l]<num2[b.l] : a.r<b.r;}void AddEdge(const int &U,const int &V){v[++es]=V; next[es]=first[U]; first[U]=es;}void dfs(int U){    Lt[U]=++now; fdfn[now]=U; t[now].v=w[U]; t[now].p=now; vis[U]=1;    for(int i=first[U];i;i=next[i]) if(!vis[v[i]]) dfs(v[i]);    Rt[U]=now;}void Val_Make_Block(){    int sz=sqrt(en); if(!sz) sz=1;    for(;sum*sz<en;++sum)      {        l[sum]=(sum-1)*sz+1; int r=sum*sz;        for(int i=l[sum];i<=r;++i) num[i]=sum;      }    l[sum]=(sum-1)*sz+1;    for(int i=l[sum];i<=en;++i) num[i]=sum;}void Mo_Make_Block(){    int sum=1,sz=sqrt(n); if(!sz) sz=1;    for(;sum*sz<n;++sum)      {        int r=sum*sz;        for(int i=(sum-1)*sz+1;i<=r;++i) num2[i]=sum;      }    for(int i=(sum-1)*sz+1;i<=n;++i) num2[i]=sum;}void Insert(const int &x){++b[x]; ++cnts[num[x]];}void Delete(const int &x){--b[x]; --cnts[num[x]];}int Kth(const int &x){    int cnt=0;    for(int i=1;;++i)      {        cnt+=cnts[i];        if(cnt>=x)          {            cnt-=cnts[i];            for(int j=l[i];;++j)            {cnt+=b[j]; if(cnt>=x) return j;}          }      }}int main(){	R(n); for(int i=1;i<=n;++i) R(w[i]);	for(int i=1;i<n;++i)	  {	  	R(from); R(to);	  	AddEdge(from,to);	  	AddEdge(to,from);	  }	dfs(1); sort(t+1,t+n+1);    ma[a[t[1].p]=++en]=fdfn[t[1].p];    for(int i=2;i<=n;++i)      {        if(t[i].v!=t[i-1].v) ++en;        ma[a[t[i].p]=en]=fdfn[t[i].p];      }    Val_Make_Block(); R(m);    for(int i=1;i<=m;++i)	  {R(X); R(K); Q[i].l=Lt[X]; Q[i].r=Rt[X]; Q[i].k=K; Q[i].p=i;}	Mo_Make_Block();	sort(Q+1,Q+m+1);	for(int i=Q[1].l;i<=Q[1].r;++i) Insert(a[i]);    anss[Q[1].p]=ma[Kth(Q[1].k)];    for(int i=2;i<=m;++i)      {        if(Q[i].l<Q[i-1].l) for(int j=Q[i-1].l-1;j>=Q[i].l;--j) Insert(a[j]);        else for(int j=Q[i-1].l;j<Q[i].l;++j) Delete(a[j]);        if(Q[i].r<Q[i-1].r) for(int j=Q[i-1].r;j>Q[i].r;--j) Delete(a[j]);        else for(int j=Q[i-1].r+1;j<=Q[i].r;++j) Insert(a[j]);        anss[Q[i].p]=ma[Kth(Q[i].k)];      }    for(int i=1;i<=m;++i) P(anss[i]),puts("");	return 0;}