#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e2+5,M=5e5+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,q,A[N];
vector<int> S[N];
int fa[N],d[N],Id[N],Ih,Tp[N],siz[N],son[N];
void dfs1(int x,int La){
	fa[x]=La;d[x]=d[La]+1;siz[x]=1;
	for(int i:S[x]) if(i^La) dfs1(i,x),siz[x]+=siz[i],siz[i]>siz[son[x]]&&(son[x]=i);
}
void dfs2(int x,int La){
	Tp[x]=La;Id[x]=++Ih;if(son[x]) dfs2(son[x],La);
	for(int i:S[x]) if(i^fa[x]&&i^son[x]) dfs2(i,i);
}
int LCA(int x,int y){
	while(Tp[x]^Tp[y]) d[Tp[x]]>d[Tp[y]]?(x=fa[Tp[x]]):(y=fa[Tp[y]]);
	return d[x]<d[y]?x:y;
}
int mx[N][20],mi[N][20];
int MAX(int x,int y){return Id[x]>Id[y]?x:y;}
int MIN(int x,int y){return Id[x]<Id[y]?x:y;}
int qx(int x,int y){int d=__lg(y-x+1);return MAX(mx[x][d],mx[y-(1<<d)+1][d]);}
int qi(int x,int y){int d=__lg(y-x+1);return MIN(mi[x][d],mi[y-(1<<d)+1][d]);}
struct seg{int l,r,col;};vector<seg> P[N];
vector<pii> Q[N];
int ans[N];
namespace BIT{
	int f[N];void add(int x,int y){while(x) f[x]+=y,assert(f[x]>=0),x-=x&-x;}
	int qry(int x){int ans=0;while(x<=m) ans+=f[x],x+=x&-x;return ans;}
}
void Add(int x,int c){
	while(x){
		int y=Tp[x],r=d[x];
		while(!P[y].empty()){
			seg p=P[y].back();
			if(r<p.l) break;
			P[y].pop_back();
			BIT::add(p.col,-(min(r,p.r)-p.l+1));
			if(r>=p.r) continue;
			p.l=r+1;P[y].emplace_back(p);
		}
		BIT::add(c,r-d[y]+1);P[y].push_back((seg){d[y],r,c});
		x=fa[y];
	}
}
void Solve(){
	int i,j;scanf("%d%d%d",&n,&m,&q);
	for(i=1;i<n;i++) {
		int x,y;scanf("%d%d",&x,&y);
		S[x].emplace_back(y);S[y].emplace_back(x);
	}
	dfs1(1,0);dfs2(1,1);
	for(i=1;i<=m;i++) scanf("%d",&A[i]);
	for(i=m;i;i--) {
		for(mx[i][0]=A[i],j=1;i+(1<<j)-1<=m;j++) mx[i][j]=MAX(mx[i][j-1],mx[i+(1<<j-1)][j-1]);
		for(mi[i][0]=A[i],j=1;i+(1<<j)-1<=m;j++) mi[i][j]=MIN(mi[i][j-1],mi[i+(1<<j-1)][j-1]);
	}
	for(i=1;i<=q;i++) {
		int x,y;scanf("%d%d",&x,&y);
		Q[y].emplace_back(x,i);
		ans[i]=-d[LCA(qx(x,y),qi(x,y))]+1;
	}
	for(i=1;i<=m;i++){
		Add(A[i],i);
		for(auto j:Q[i]) ans[j.se]+=BIT::qry(j.fi);
	}
	for(i=1;i<=q;i++) printf("%d\n",ans[i]);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}