#include<bits/stdc++.h>

using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif


#define ll long long
#define pb push_back
#define st first
#define nd second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
#define endl '\n'
int inf=1000000007;
ll infl=1000000000000000007;
ll mod=998244353;

const int N=100007,S=300,pot=1<<17;


int seg[2*pot+7];
int seg1[2*pot+7];

int que(int v,int a,int b,int l,int r)
{
	if(a<=l&&b>=r) return seg[v];
	if(r<a||l>b) return inf;
	return min(que(2*v,a,b,l,(l+r)/2),que(2*v+1,a,b,(l+r)/2+1,r));
}
int que1(int v,int a,int b,int l,int r)
{
	if(a<=l&&b>=r) return seg1[v];
	if(r<a||l>b) return -inf;
	return max(que1(2*v,a,b,l,(l+r)/2),que1(2*v+1,a,b,(l+r)/2+1,r));
}

vector<pair<int,int>>W[N];


struct Z
{
	int l,r,i;
};

bool cmp(Z a,Z b)
{
	if(a.l/S==b.l/S) return a.r<b.r;
	else return a.l<b.l;
}

vector<int>G[N];
int O[N];
int ile[N];
int c[N];
int res[N];
int pre[N],post[N],cc;

void dfs(int v,int o)
{
	pre[v]=++cc;
	O[v]=o;
	for(auto u:G[v])
	{
		if(u==o) continue;
		dfs(u,v);
	}
	post[v]=cc;
}

int ans;

void add(int v)
{
	while(v!=0)
	{
		ile[v]++;
		if(ile[v]==1) ans++;
		v=O[v];
	}
}

void del(int v)
{
	while(v!=0)
	{
		ile[v]--;
		if(ile[v]==0) ans--;
		v=O[v];
	}
}

signed main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,m,q;
	cin>>n>>m>>q;
	FOR(i,1,n-1)
	{
		int a,b;
		cin>>a>>b;
		G[a].pb(b);
		G[b].pb(a);
	}
	dfs(1,0);
	for(int i=1;i<=2*pot;i++)
	{
		seg[i]=inf;
		seg1[i]=-inf;
	}
	for(int i=1;i<=m;i++)
	{
		cin>>c[i];
		seg[i+pot-1]=pre[c[i]];
		seg1[i+pot-1]=pre[c[i]];
	}
	for(int i=pot-1;i>0;i--)
	{
		seg[i]=min(seg[2*i],seg[2*i+1]);
		seg1[i]=max(seg1[2*i],seg1[2*i+1]);
	}
	vector<Z>Q;
	for(int i=1;i<=q;i++)
	{
		int l,r;
		cin>>l>>r;
		Q.pb({l,r,i});
		int L=que(1,l,r,1,pot),R=que1(1,l,r,1,pot);
		cout<<R-L+1<<endl;
		//W[L].pb({R,i});
	}
	/*sort(all(Q),cmp);
	int L=0,R=0;
	for(auto x:Q)
	{
		while(L<x.l)
		{
			del(c[L]);
			L++;
		}
		while(L>x.l)
		{
			L--;
			add(c[L]);
		}
		while(R>x.r)
		{
			del(c[R]);
			R--;
		}
		while(R<x.r)
		{
			R++;
			add(c[R]);
		}
		res[x.i]=ans;
	}
	for(int i=1;i<=n;i++)
	{
		
	}
	for(int i=1;i<=q;i++) cout<<res[i]<<endl;*/
	
	return 0;
}