/*input
10 4 4
1 3 2 4
3 4 4 3 1 3 1 2 4 2
2 1
3 1
4 2
5 2
6 4
7 6
8 5
9 2
10 4
1
7 8
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-4;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;  
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int pu[maxn][18],pd[maxn][18];
int par[maxn][18];
int pos[maxn];
int arr[maxn];
vector<int> v[maxn];
vector<int> pv[maxn];
int dep[maxn];
int fon[maxn];
int n,m,c;
void dfs(int u,int p){
    par[u][0]=p;
    if(pos[u]!=-1) pv[pos[u]].pb(u);
    for(int x:v[u]){
        if(x==p) continue;
        dep[x]=dep[u]+1;
        dfs(x,u);
    }
    fon[u]=pv[1].back();
    if(pos[u]==-1) return;
    pu[u][0]=pv[pos[u]+1].back();
    pd[u][0]=pv[pos[u]-1].back();
    pv[pos[u]].pop_back();
}
int get(int a,int d){
    while(d){
        a=par[a][__lg(lowb(d))];
        d-=lowb(d);
    } 
    return a;
}
int lca(int a,int b){
    if(dep[a]<dep[b]) swap(a,b);
    a=get(a,dep[a]-dep[b]);
    if(a==b) return a;
    for(int j=17;j>=0;j--){
        if(par[a][j]!=par[b][j]){
            a=par[a][j],b=par[b][j];
        }
    }
    return par[a][0];
}
pii qr[maxn];
vector<int> qq[maxn];
pii rng[maxn];
void dfs2(int u,int p){
    if(pos[u]!=-1) pv[pos[u]].pb(u);
    for(int x:v[u]){
        if(x==p) continue;
        dfs2(x,u);
    }
    for(int x:qq[u]){
        int mid=(rng[x].f+rng[x].s+1)/2;
        int tp=qr[x].f,st=qr[x].s;
        int t=pv[mid].back();
        if(t!=-1){
            if(dep[t]>=dep[tp]) ++st;
            for(int j=17;j>=0;j--){
                if(pd[t][j]!=-1 and dep[pd[t][j]]>=dep[tp]){
                    st+=(1<<j);
                    t=pd[t][j];
                }
            }
        }

        if(st>=mid){
            rng[x].f=mid;
        }
        else{
            rng[x].s=mid-1;
        }
    }
    if(pos[u]==-1) return;
    pv[pos[u]].pop_back();
}
int pp[maxn];
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m,c;
    cin>>n>>m>>c;
    REP(i,m) pp[i]=-1;
    REP1(i,c){
        int x;
        cin>>x;
        --x;
        pp[x]=i;
    }
    REP(i,n){
        int x;
        cin>>x;
        --x;
        pos[i]=pp[x];
    }
    REP(i,n-1){
        int a,b;
        cin>>a>>b;
        --a,--b;
        v[a].pb(b),v[b].pb(a);
    }
    REP(i,c+3) pv[i].pb(-1);
    dfs(0,-1);
    REP1(j,17){
        REP(i,n){
            if(par[i][j-1]!=-1) par[i][j]=par[par[i][j-1]][j-1];
            else par[i][j]=-1;
            if(pu[i][j-1]!=-1) pu[i][j]=pu[pu[i][j-1]][j-1];
            else pu[i][j]=-1;
            if(pd[i][j-1]!=-1) pd[i][j]=pd[pd[i][j-1]][j-1];
            else pd[i][j]=-1;
        }
    }
    int q;
    cin>>q;
    REP(i,q){
        int s,t;
        cin>>s>>t;
        --s,--t;
        int z=lca(s,t);
        s=fon[s];
        int ans=0;
        if(s!=-1){
            if(dep[s]>dep[z]) ++ans;
            for(int j=17;j>=0;j--){
                if(pu[s][j]!=-1 and dep[pu[s][j]]>dep[z]){
                    s=pu[s][j];
                    ans+=(1<<j);
                }
            }
        }
        qr[i]={z,ans};
        rng[i]={ans,c};
        qq[t].pb(i);
        //go frm z to t 
    }
    REP(asd,18){
        dfs2(0,-1);
    }
    REP(i,q){
        cout<<rng[i].f<<'\n';
    }
}