#include<iostream>
#include<cstdio>
#include<vector>
#include<set>
#define N 100000
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
struct reads
{
    int num,data;
};
int n,m,q,X[N+1],lg[N+1],depth[N+1],fa[N+1][21];
bool used[N+1];
long long st[N+1],ans[N+1],c[N+1],ST[N+1][21];
vector<int>E[N+1];
set<int>s[N+1];
vector<reads>p[N+1];
vector<reads>v[N+1];
void add_edge(int x,int y)
{
    E[x].push_back(y),E[y].push_back(x);
    return;
}
int lowbit(int x)
{
    return x&(-x);
}
void add(int x,int d)
{
    for (;x<=m;x+=lowbit(x)) c[x]+=d;
    return;
}
long long query(int x)
{
    long long res=0;
    for (;x>=1;x-=lowbit(x)) res+=c[x];
    return res;
}
void merge(int x,int y,int z)
{
    int pv,nt;
    if (s[x].size()>s[y].size()) swap(s[x],s[y]);
    for (auto it:s[x])
    {
	auto it2=s[x].lower_bound(it+1);
	if (it2!=s[x].end()) p[(*it2)].push_back((reads){it,-z});
    }
    for (auto it:s[x])
    {
	auto it2=s[y].lower_bound(it);
	if (it2!=s[y].end()) nt=(*it2);
	else nt=-1;
	if (it2!=s[y].begin()) it2--,pv=(*it2);
	else pv=-1;
	if (pv!=-1) p[it].push_back((reads){pv,z});
	if (nt!=-1) p[nt].push_back((reads){it,z});
	if (pv!=-1&&nt!=-1) p[nt].push_back((reads){pv,-z});
	s[y].insert(it);
    }
    return;
}
void dfs(int x)
{
    used[x]=1;
    for (auto it:s[x])
    {
	auto it2=s[x].lower_bound(it+1);
	if (it2!=s[x].end()) p[(*it2)].push_back((reads){it,depth[x]});
    }
    for (int i=0;i<E[x].size();++i)
	if (!used[E[x][i]])
	    fa[E[x][i]][0]=x,depth[E[x][i]]=depth[x]+1,dfs(E[x][i]),merge(E[x][i],x,depth[x]);
    return;
}
int lca(int x,int y)
{
    if (depth[x]<depth[y]) swap(x,y);
    for (int i=lg[n];i>=0;--i)
	if (depth[fa[x][i]]>=depth[y])
	    x=fa[x][i];
    if (x==y) return x;
    for (int i=lg[n];i>=0;--i)
	if (fa[x][i]!=fa[y][i])
	    x=fa[x][i],y=fa[y][i];
    return fa[x][0];
}
int calc(int l,int r)
{
    int lw=lg[r-l+1];
    return lca(ST[l][lw],ST[r-(1<<lw)+1][lw]);
}
int main()
{
    int x,y,l,r;
    for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
    n=read(),m=read(),q=read();
    for (int i=1;i<=n-1;++i) x=read(),y=read(),add_edge(x,y);
    for (int i=1;i<=m;++i) X[i]=read(),s[X[i]].insert(i),ST[i][0]=X[i];
    depth[1]=1,dfs(1);
    for (int i=1;i<=m;++i) st[i]=st[i-1]+depth[X[i]];
    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];
    for (int i=1;i<=lg[m];++i)
	for (int j=1;j+(1<<i)-1<=m;++j)
	    ST[j][i]=lca(ST[j][i-1],ST[j+(1<<(i-1))][i-1]);
    for (int i=1;i<=q;++i) l=read(),r=read(),ans[i]=st[r]-st[l-1]-(depth[calc(l,r)]-1),v[r].push_back((reads){i,l});
    for (int i=1;i<=m;++i)
    {
	for (int j=0;j<p[i].size();++j) add(m-p[i][j].num+1,p[i][j].data);
	for (int j=0;j<v[i].size();++j) ans[v[i][j].num]-=query(m-v[i][j].data+1);
    }
    for (int i=1;i<=q;++i) printf("%lld\n",ans[i]);
    return 0;
}