#include<iostream>
#include<cstdio>
#include<vector>
#define N 700000
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;
}
int n,m,q,depth[N+1],a[N+1],fa[N+1],lg[N+1],hs[N+1],dfn[N+1],top[N+1],leng,sz[N+1],tong[N+1],length;
bool used[N+1];
long long ans;
vector<int>E[N+1];
void add(int x,int y)
{
    E[x].push_back(y),E[y].push_back(x);
    return;
}
void dfs(int x)
{
    used[x]=sz[x]=1;
    for (int i=0;i<E[x].size();++i)
	if (!used[E[x][i]])
	{
	    fa[E[x][i]]=x,depth[E[x][i]]=depth[x]+1,dfs(E[x][i]),sz[x]+=sz[E[x][i]];
	    if (sz[E[x][i]]>sz[hs[x]]) hs[x]=E[x][i];
	}
    return;
}
void dfs2(int x)
{
    dfn[x]=++leng;
    if (hs[x]) top[hs[x]]=top[x],dfs2(hs[x]);
    for (int i=0;i<E[x].size();++i)
	if (fa[E[x][i]]==x&&E[x][i]!=hs[x])
	    top[E[x][i]]=E[x][i],dfs2(E[x][i]);
    return;
}
int lca(int x,int y)
{
    while (top[x]!=top[y])
    {
	if (depth[top[x]]<depth[top[y]]) swap(x,y);
	x=fa[top[x]];
    }
    if (depth[x]<depth[y]) swap(x,y);
    return y;
}
bool LENG(int x,int y)
{
    return dfn[x]<=dfn[y]&&dfn[y]<=dfn[x]+sz[x]-1;
}
struct seg
{
    struct node
    {
	int l,r,data,res;
    };
    node tree[(N<<2)+1];
    void build(int k,int l,int r)
    {
	tree[k].l=l,tree[k].r=r,tree[k].data=a[l],tree[k].res=1;
	for (int i=l+1;i<=r;++i)
	{
	    tree[k].data=lca(tree[k].data,a[i]);
	    if (tree[k].data==a[i]) tree[k].res++;
	}
	if (l==r) return;
	int mid=(l+r)>>1;
	build(k<<1,l,mid),build(k<<1|1,mid+1,r);
	return;
    }
    int query(int k,int d)
    {
	if (tree[k].l==tree[k].r) return LENG(d,tree[k].data);
	if (LENG(tree[k<<1].data,d)) return query(k<<1,d)+tree[k].res-tree[k<<1].res;
	else if (LENG(d,tree[k<<1].data)) return query(k<<1|1,d);
	else return query(k<<1|1,lca(d,tree[k<<1].data));
    }
    void solve(int k,int l,int r)
    {
	if (tree[k].l==l&&tree[k].r==r)
	{
	    tong[++length]=k;
	    return;
	}
	int mid=(tree[k].l+tree[k].r)>>1;
	if (r<=mid) solve(k<<1,l,r);
	else if (l>=mid+1) solve(k<<1|1,l,r);
	else solve(k<<1,l,mid),solve(k<<1|1,mid+1,r);
	return;
    }
};
seg T;
int main()
{
    int k,x,y,l,r,d;
    n=read(),m=read(),q=read();
    for (int i=2;i<=n;++i) lg[i]=lg[i>>1]+1;
    for (int i=1;i<=n-1;++i) x=read(),y=read(),add(x,y);
    depth[1]=top[1]=1,dfs(1),dfs2(1);
    for (int i=1;i<=m;++i) a[i]=read();
    T.build(1,1,m);
    while (q--)
    {
	k=read(),length=0;
	while (k--) l=read(),r=read(),T.solve(1,l,r);
	d=T.tree[tong[1]].data,ans=T.tree[tong[1]].res;
	for (int i=2;i<=length;++i) ans+=T.query(tong[i],d),d=lca(d,T.tree[tong[i]].data);
	printf("%lld\n",ans);
    }
    return 0;
}