# include <bits/stdc++.h>
using namespace std;
const int SIZE=(1<<21)+1;
typedef long long ll;
char ibuf[SIZE],obuf[SIZE],*iS,*iT,*oS=obuf,*oT=obuf;
char* flush(){fwrite(obuf,1,oT-oS,stdout);return oT=obuf;}
struct Flusher{~Flusher(){flush();}}flusher;
# define gc() (iS==iT && (iT=(iS=ibuf)+fread(ibuf,1,SIZE,stdin),iS==iT)?EOF:*iS++)
# define pc(c) ((oT==oS+SIZE && flush()),*oT++=(c))
int read()
{
	int x=0;
	char ch=gc();
	for(;ch<'0' || ch>'9';ch=gc());
	for(;ch>='0' && ch<='9';ch=gc()) x=x*10+ch-'0';
	return x;
}
void write(ll x)
{
	if(x>=10) write(x/10);
	pc(x%10+'0');
}
vector<int> G[700010];
int a[700010],stk[700010],nxt[700010][20],top[20][700010],dep[700010],dfn[700010],sz[700010],opn[700010],minn[21][1400010],tot,tot2;
int Low(int u,int v){return dep[u]<dep[v]?u:v;}
int lca(int u,int v)
{
	u=opn[u];v=opn[v];
	if(u>v) swap(u,v);
	int k=__lg(v-u+1);
	return Low(minn[k][u],minn[k][v-(1<<k)+1]);
}
bool in(int u,int v){return dfn[u]<=dfn[v] && dfn[v]<dfn[u]+sz[u];}
int Top(int l,int r)
{
	int k=__lg(r-l+1);
	return lca(top[k][l],top[k][r-(1<<k)+1]);
}
void dfs(int u,int fa)
{
	sz[u]=1;dfn[u]=++tot;
	opn[u]=++tot2;minn[0][tot2]=u;
	for(int v:G[u])
	{
		if(v==fa) continue;
		dep[v]=dep[u]+1;
		dfs(v,u);sz[u]+=sz[v];
		minn[0][++tot2]=u;
	}
}
int calc(int &u,int l,int r)
{
	int ans=0,p=l;
	if(u && !in(a[p],u))
	{
		for(int i=19;i>=0;i--)
			if(!in(a[nxt[p][i]],u))
				p=nxt[p][i];
		p=nxt[p][0];
	}
	if(p>r) return 0;
	for(int i=19;i>=0;i--)
		if(nxt[p][i]<=r) ans+=1<<i,p=nxt[p][i];
	u=u?lca(u,Top(l,r)):Top(l,r);
	return ans+1;
}
int main()
{
	int n,m,q,u,v;
	n=read();m=read();q=read();
	for(int i=1;i<n;i++)
	{
		u=read();v=read();
		G[u].push_back(v);G[v].push_back(u);
	}
	dfs(1,0);
	for(int i=1;i<=20;i++)
		for(int j=1;j+(1<<i)-1<=tot2;j++)
			minn[i][j]=Low(minn[i-1][j],minn[i-1][j+(1<<(i-1))]);
	for(int i=1;i<=m;i++) a[i]=read();
	int tp=0;
	stk[0]=m+1;nxt[m+1][0]=m+1;
	for(int i=m;i>=1;i--)
	{
		int u=a[i];
		while(tp && !in(a[stk[tp]],u)) u=lca(u,a[stk[tp]]),tp--;
		nxt[i][0]=stk[tp];stk[++tp]=i;
	}
	for(int i=m+1;i>=1;i--)
		for(int j=1;j<=19;j++)
			nxt[i][j]=nxt[nxt[i][j-1]][j-1];
	for(int i=1;i<=m;i++) top[0][i]=a[i];
	for(int i=1;i<=19;i++)
		for(int j=1;j+(1<<i)-1<=m;j++)
			top[i][j]=lca(top[i-1][j],top[i-1][j+(1<<(i-1))]);
	while(q--)
	{
		int k=read(),l,r,u=0;
		ll ans=0;
		while(k--) l=read(),r=read(),ans+=calc(u,l,r);
		write(ans);pc('\n');
	}
	return 0;
}