#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,m,q;
int a[700005],b[700005];

int cnt;
int head[700005];
struct eg{
	int to,nxt;
}edge[1400005];

void make(int u,int v){
	edge[++cnt].to = v;
	edge[cnt].nxt = head[u];
	head[u] = cnt;
}

int dfn[700005],siz[700005],fa[700005],dep[700005];
int ST[21][700005];
void dfs(int u,int f){
	dfn[u] = ++cnt;
	ST[0][cnt] = u;
	fa[u] = f;
	dep[u] = dep[f] + 1;
	siz[u] = 1;
	for(int i = head[u];i;i = edge[i].nxt){
		int v = edge[i].to;
		if(v == f) continue;
		dfs(v,u);
		siz[u] += siz[v];
	}
}

inline int cmp(int x,int y){
	if(dep[x] < dep[y]) return x;
	return y;
}

inline int query(int l,int r){
	int x = __lg(r - l + 1);
	return cmp(ST[x][l],ST[x][r - (1 << x) + 1]);
}

inline int LCA(int u,int v){
	if(u == v) return u;
	u = dfn[u];v = dfn[v];
	if(u > v) swap(u,v);
	return fa[query(u + 1,v)];
}

struct fenwick{
	int tree[700005];
	#define lowbit(x) (x & (-x))
	void upd(int pos,int C){
		while(pos <= n){
			chkmax(tree[pos],C);
			pos += lowbit(pos);
		}
	}

	int qry(int pos){
		int res = 0;
		while(pos){
			chkmax(res,tree[pos]);
			pos -= lowbit(pos);
		}
		return res;
	}
}Ord,Rev;

struct rangelca{
	int ST[21][700005],op;//op=0 最小值.op=1 最大值
	inline int cmp(int x,int y){
		if(!op){
			if(dfn[x] < dfn[y]) return x;
			return y;
		}
		if(dfn[x] > dfn[y]) return x;
		return y;
	}
	void init(){
		rep(i,1,m) ST[0][i] = a[i];
		rep(i,1,19){
			rep(j,1,m){
				if(j + (1 << i) - 1 > m) break;
				ST[i][j] = cmp(ST[i - 1][j],ST[i - 1][j + (1 << (i - 1))]);
			}
		}
	}
	inline int qry(int l,int r){
		int x = __lg(r - l + 1);
		return cmp(ST[x][l],ST[x][r - (1 << x) + 1]);
	}
}Mn,Mx;

inline int getres(int l,int r){
	return LCA(Mn.qry(l,r),Mx.qry(l,r));
}

int sz,_sz;
ll result[700005];
struct qry{
	int x,y,id,op;
}Q[2800005],sp[2100005],tmp[2800005];

bool cmp2(qry s,qry t){
	if(s.x != t.x) return s.x < t.x;
	return s.id < t.id;
}
vector <qry> QQ[700005];
vector <int> PP[700005];

void dfs2(int u){
	for(int id:PP[u]) Q[++sz] = {id,b[id],0,1};
	for(qry I:QQ[u]){
		Q[++sz] = {I.y,I.x,I.id,1};
		Q[++sz] = {I.x - 1,I.x,I.id,-1};
	}
	for(int i = head[u];i;i = edge[i].nxt){
		int v = edge[i].to;
		if(v == fa[u]) continue;
		dfs2(v);
	}
	for(int id:PP[u]) Q[++sz] = {id,b[id],0,-1};
}

int tree[700005];
#define lowbit(x) (x & (-x))
void upd(int pos,int C){
	while(pos <= m){
		tree[pos] += C;
		pos += lowbit(pos);
	}
}

int query(int pos){
	int res = 0;
	while(pos){
		res += tree[pos];
		pos -= lowbit(pos);
	}
	return res;
}

void cdq(int l,int r){
	if(l == r) return;
	int mid = (l + r) >> 1;
	cdq(l,mid);cdq(mid+1,r);
	int j = l;
	rep(i,mid+1,r){
		while(j <= mid && Q[j].x <= Q[i].x){
			if(!Q[j].id) upd(Q[j].y,Q[j].op);
			j++;
		}
		if(Q[i].id) result[Q[i].id] += Q[i].op * query(Q[i].y);
	}
	while(j > l){
		j--;
		if(!Q[j].id) upd(Q[j].y,-Q[j].op);
	}

	int i = l,k = l;
	j = mid + 1;
	while(i <= mid && j <= r){
		if(Q[i].x < Q[j].x) tmp[k++] = Q[i++];
		else tmp[k++] = Q[j++];
	}
	while(i <= mid) tmp[k++] = Q[i++];
	while(j <= r) tmp[k++] = Q[j++];
	for(i = l;i <= r;i++) Q[i] = tmp[i];
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d%d%d",&n,&m,&q);
	rep(i,1,n - 1){
		int u,v;
		scanf("%d%d",&u,&v);
		make(u,v);make(v,u);
	}
	cnt = 0;
	dfs(1,0);
	rep(i,1,19){
		rep(j,1,n){
			if(j + (1 << i) - 1 > n) break;
			ST[i][j] = cmp(ST[i - 1][j],ST[i - 1][j + (1 << (i - 1))]); 
		}
	}
	rep(i,1,m){
		scanf("%d",&a[i]);
		PP[a[i]].eb(i);
		int u = a[i];
		b[i] = max(Ord.qry(dfn[u] - 1),Rev.qry(n - dfn[u] - siz[u] + 1)) + 1;
		Ord.upd(dfn[u],i);
		Rev.upd(n - dfn[u] + 1,i);
	}
//	rep(i,1,m) printf("%d ",b[i]);
//	printf("\n");
	Mn.op = 0;Mx.op = 1;
	Mn.init();Mx.init();
	int k,l,r,u;
	rep(i,1,q){
		scanf("%d",&k);
		rep(j,1,k){
			scanf("%d%d",&l,&r);
			if(j == 1){
				sp[++_sz] = {r,l,i,1};
				sp[++_sz] = {l - 1,l,i,-1};
				u = getres(l,r);
			}else{
				QQ[u].push_back({l,r,i,0});
				u = LCA(u,getres(l,r));
			}
		}
	}
	rep(i,1,m) sp[++_sz] = {i,b[i],0,1};
	dfs2(1);
//	rep(i,1,sz) printf("%d %d %d %d\n",Q[i].x,Q[i].y,Q[i].id,Q[i].op);
	cdq(1,sz);
	sort(sp + 1,sp + _sz + 1,cmp2);
	rep(i,1,_sz){
		if(!sp[i].id) upd(sp[i].y,sp[i].op);
		else result[sp[i].id] += sp[i].op * query(sp[i].y);
	}
	rep(i,1,q) printf("%lld\n",result[i]);
	return 0;
}