#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
struct seg{
    int l,r;mutable int v;
    bool operator<(const seg &a)const{return l<a.l;}
};set<seg> s;
#define it set<seg>::iterator
vector<pair<int,int> > ql[N];
vector<int> to[N];
int fa[N],d[N],sz[N],son[N];
int dfn[N],tp[N],num;
int n,m,q,p[N],c[N],an[N];

void add(int x,int v){for(;x;x-=x&-x)c[x]+=v;}
int ask(int x){int r=0;for(;x<=n;x+=x&-x)r+=c[x];return r;}

void dfs1(int x,int f){
    fa[x]=f,d[x]=d[f]+1,sz[x]=1;
    for(auto j:to[x]){
        if(j==f)continue;dfs1(j,x);
        if(sz[son[x]]<sz[j])son[x]=j;
        sz[x]+=sz[j];
    }
}

void dfs2(int x,int f){
    dfn[x]=++num,tp[x]=f;
    if(son[x])dfs2(son[x],f);
    for(auto j:to[x])
        if(j!=fa[x]&&j!=son[x])dfs2(j,j);
}

it in(int l,int r,int w){add(w,r-l+1);return s.insert({l,r,w}).first;}
void de(int l,int r,int w){add(w,-r+l-1),s.erase({l,r,w});}

it split(int x){
    it pl=s.lower_bound({x,-1,0});
    if(pl!=s.end()&&pl->l==x)return pl;
    if(pl->r<x)return s.end();pl--;
    int l=pl->l,r=pl->r,v=pl->v;assert(l<x&&r>=x);
    de(l,r,v);in(l,x-1,v);return in(x,r,v);
}

void ins(int l,int r,int w){
    it itr=split(r+1),itl=split(l),t;
    for(it pl=itl;pl!=itr;)t=pl,assert(t!=s.end()),pl++,de(t->l,t->r,t->v);
    in(l,r,w);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin>>n>>m>>q; int x,y;
    for(int i=1;i<n;i++)cin>>x>>y,
        to[x].push_back(y),to[y].push_back(x);
    dfs1(1,0);dfs2(1,1);
    for(int i=1;i<=m;i++)cin>>p[i];
    for(int i=1;i<=q;i++)
        cin>>x>>y,ql[y].push_back({x,i});s.insert({1,n,0});
    for(int i=1;i<=m;i++){
        if(i>1){
            x=p[i-1],y=p[i];
            while(tp[x]!=tp[y]){
                if(d[tp[x]]<d[tp[y]])
                    ins(dfn[tp[y]],dfn[y],i),y=fa[tp[y]];
                else ins(dfn[tp[x]],dfn[x],i-1),x=fa[tp[x]];
            }if(d[x]<d[y])ins(dfn[x],dfn[y],i),p[i]=x;
            else{
                if(x!=y)ins(dfn[y]+1,dfn[x],i-1);
                ins(dfn[y],dfn[y],i);p[i]=y;
            }
        }for(auto j:ql[i])
            an[j.second]=(j.first==i?1:ask(j.first));
    }for(int i=1;i<=q;i++)cout<<an[i]<<"\n";
    return 0;
}