#include <iostream>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
const int N=1e6+9,INF=1e9;
const double eps=1e-5;
typedef pair <int,int> PII;
inline int read()
{
    int x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
inline ll readll()
{
    ll x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
struct node{
    int to,nxt;
} edge[N<<1];
int n,m,c,q,id[N],a[N],tot,head[N],pos1[N],pos[N],fa[N][20],lg[N],f[N][20],g[N][20],dep[N],ans[N];
vector <PII> qu[N];
void addedge(int u,int v)
{
    edge[++tot].to=v,edge[tot].nxt=head[u],head[u]=tot;
}
void dfs(int u,int father)
{
    if(a[u]==1) pos1[u]=u;
    else pos1[u]=pos1[father];
    int x=pos[a[u]];
    pos[a[u]]=u;
    f[u][0]=pos[a[u]+1],g[u][0]=pos[a[u]-1],dep[u]=dep[father]+1,fa[u][0]=father;
    for(int i=head[u];i;i=edge[i].nxt)
    {
        int v=edge[i].to;
        if(v==father) continue;
        dfs(v,u);
    }
    pos[a[u]]=x;
}
int LCA(int x,int y)
{
    if(dep[x]<dep[y]) swap(x,y);
    while(dep[x]>dep[y]) x=fa[x][lg[dep[x]-dep[y]]];
    if(x==y) return x;
    for(int i=lg[dep[x]];i>=0;i--)
        if(fa[x][i]!=fa[y][i]) x=fa[x][i],y=fa[y][i];
    return fa[x][0];
}
bool check(int x,int p,int lim)
{
    int u=pos[x];
    if(dep[u]<dep[p]) return false;
    int ans=x;
    for(int i=lg[dep[u]];i>=0;i--)
        if(dep[g[u][i]]>=dep[p]) ans-=(1<<i),u=g[u][i];
    return ans<=lim;
}
void dfs2(int u,int father)
{
    int x=pos[a[u]];
    pos[a[u]]=u;
    for(int i=0;i<qu[u].size();i++)
    {
        int s=qu[u][i].first,j=qu[u][i].second;
        int p=LCA(s,u),tmp=0;
        s=pos1[s];
        if(dep[s]>=dep[p])
        {
            for(int i=lg[dep[s]];i>=0;i--)
                if(dep[f[s][i]]>=dep[p]) s=f[s][i];
            tmp=a[s];
        }
        int l=tmp+1,r=c,res=tmp;
        while(l<=r)
        {
            int mid=(l+r)>>1;
            if(check(mid,p,tmp+1)) l=mid+1,res=mid;
            else r=mid-1;
        }
        ans[j]=res;
    }
    for(int i=head[u];i;i=edge[i].nxt)
    {
        int v=edge[i].to;
        if(v!=father) dfs2(v,u);
    }
    pos[a[u]]=x;
}
int main()
{
    // #define FILEIO
    #ifdef FILEIO
        freopen("in.in","r",stdin);
        freopen("out.out","w",stdout);
    #endif
    n=read(),m=read(),c=read();
    for(int i=1;i<=c;i++) id[read()]=i;
    for(int i=1;i<=n;i++) a[i]=id[read()];
    for(int i=1;i<n;i++)
    {
        int u=read(),v=read();
        addedge(u,v),addedge(v,u);
    }
    dfs(1,0);
    q=read();
    for(int i=2;i<=n;i++) lg[i]=lg[i>>1]+1;
    for(int i=1;i<=lg[n];i++)
        for(int j=1;j<=n;j++)
            fa[j][i]=fa[fa[j][i-1]][i-1],f[j][i]=f[f[j][i-1]][i-1],g[j][i]=g[g[j][i-1]][i-1];
    for(int i=1;i<=q;i++)
    {
        int s=read(),t=read();
        qu[t].push_back({s,i});
    }
    dfs2(1,0);
    for(int i=1;i<=q;i++) cout<<ans[i]<<'\n';
    cerr<<endl<<1e3*clock()/CLOCKS_PER_SEC<<"ms";
    return 0;
}