#include<bits/stdc++.h>
#define ll long long
using namespace std;
int N,M,Q,Log[700005],A[700005],in[700005],out[700005],tot1,lef[700005],q[700005],tail;
int mn[20][700005],mx[20][700005];
int getmin(int l,int r){
	int len=Log[r-l+1];
	return min(mn[len][l],mn[len][r-(1<<len)+1]);
}
int getmax(int l,int r){
	int len=Log[r-l+1];
	return max(mx[len][l],mx[len][r-(1<<len)+1]);
}
int getpos1(int l,int r,int v){
	if(getmin(l,r)>v)return 0;
	int pl=l,pr=r,ans=0;
	while(pl<=pr){
		int mid=pl+pr>>1;
		if(getmin(l,mid)<=v)ans=mid,pr=mid-1;
		else pl=mid+1;
	} return ans;
}
int getpos2(int l,int r,int v){
	if(getmax(l,r)<v)return 0;
	int pl=l,pr=r,ans=0;
	while(pl<=pr){
		int mid=pl+pr>>1;
		if(getmax(l,mid)>=v)ans=mid,pr=mid-1;
		else pl=mid+1;
	} return ans;
}
vector<int>road[700005];
void dfs(int u,int fa){
	in[u]=out[u]=++tot1;
	for(int v:road[u]){
		if(v==fa)continue;
		dfs(v,u);out[u]=out[v];
	}
}
int rt[700005],tot,son[14000005][2],cnt[14000005];
void ins(int &p,int q,int l,int r,int pos){
	p=++tot;son[p][0]=son[q][0],son[p][1]=son[q][1],cnt[p]=cnt[q]+1;
	if(l==r)return;int mid=l+r>>1;
	if(pos<=mid)ins(son[p][0],son[q][0],l,mid,pos);
	else ins(son[p][1],son[q][1],mid+1,r,pos);
}
int query(int p,int q,int l,int r,int a,int b){
	if(a<=l&&r<=b)return cnt[p]-cnt[q];int mid=l+r>>1,res=0;
	if(a<=mid)res+=query(son[p][0],son[q][0],l,mid,a,b);
	if(b>mid)res+=query(son[p][1],son[q][1],mid+1,r,a,b);
	return res;
}
int tot2,L[7000005],R[7000005];
int main(){
	scanf("%d%d%d",&N,&M,&Q);
    for(int i=1;i<N;++i){
    	int u,v;scanf("%d%d",&u,&v);
    	road[u].push_back(v);road[v].push_back(u);
	} dfs(1,-1);
	for(int i=2;i<=M;++i)Log[i]=Log[i>>1]+1;
	for(int i=1;i<=M;++i){
		scanf("%d",&A[i]);
		while(tail&&in[A[q[tail]]]>=in[A[i]])--tail;
		lef[i]=q[tail];q[++tail]=i;
	}tail=0;
	for(int i=1;i<=M;++i){
		while(tail&&out[A[q[tail]]]<=out[A[i]])--tail;
		lef[i]=max(lef[i],q[tail]);q[++tail]=i;++lef[i];
	}
	for(int i=1;i<=M;++i)ins(rt[i],rt[i-1],1,M,lef[i]),mn[0][i]=in[A[i]],mx[0][i]=out[A[i]];
	for(int j=1;(1<<j)<=M;++j)for(int i=1;i+(1<<j)-1<=M;++i)mn[j][i]=min(mn[j-1][i],mn[j-1][i+(1<<j-1)]),mx[j][i]=max(mx[j-1][i],mx[j-1][i+(1<<j-1)]);
	while(Q--){
		scanf("%d",&tot2);
		for(int i=1;i<=tot2;++i)scanf("%d%d",&L[i],&R[i]);
		int Mn=1e9,Mx=0;ll res=0;
		for(int i=1;i<=tot2;++i){
			if(i==1){
				res+=1ll*query(rt[R[i]],rt[L[i]-1],1,M,1,L[i]);
				Mn=getmin(L[i],R[i]);Mx=getmax(L[i],R[i]);
				continue;
			}
			int pos1=getpos1(L[i],R[i],Mn);
			int pos2=getpos2(L[i],R[i],Mx);
			if(!pos1||!pos2){
				Mn=min(Mn,getmin(L[i],R[i]));
				Mx=max(Mx,getmax(L[i],R[i]));
				continue;
			} pos1=max(pos1,pos2);
			res+=1ll*query(rt[R[i]],rt[pos1-1],1,M,1,L[i]);
			Mn=min(Mn,getmin(L[i],R[i])),Mx=max(Mx,getmax(L[i],R[i]));
		} printf("%lld\n",res);
	}
	return 0;
}