#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;
ll inf=1e18;
const int N=1e4+100,L=21,bs=701,NN=1e6;
int A[N],B[N],C[N],D[N],E[N],n,m,k,q,dp[N],pre[N],dist[N],seg[N*4],segg[N*4];
bitset<N> is;
vector<int>g[N];
int ans;
void dfs(int v,int p=0){
for(int u:g[v])if(u!=p){
dfs(u,v);
if(is[u])is[v]=1;
}
ans+=is[v];
}
void build(int l=1,int r=m+1,int v=1){
if(r-l==1){
seg[v]=B[l];
segg[v]=B[l];
return;
}
int mid=(l+r)>>1;
build(l,mid,v<<1);
build(mid,r,v<<1|1);
seg[v]=min(seg[v<<1],seg[v<<1|1]);
segg[v]=max(segg[v<<1],segg[v<<1|1]);
}
// pii get(int lx,int rx,int l=1,int r=m+1,int v=1){
// if(lx>=r || rx<=l)return {mod,0};
// if(lx<=l && r<=rx)return {seg[v],segg[v]};
// }
int main(){
fast_io
cin>>n>>m>>q;
for1(n-1){
int u,v;cin>>u>>v;
g[u].pb(v);
g[v].pb(u);
}
for1(m)cin>>B[i];
build();
while(q--){
int l,r;cin>>l>>r;is=0;
for(int i=l;i<=r;i++)is[B[i]]=1;
ans=0;
dfs(B[l]);
cout<<ans<<endl;
}
}
