#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
bool YES(bool f){ if(f) cout << "Yes\n" ; else cout << "No\n" ; return f ; }
void YES(){cout << "Yes\n" ;}
void NO(){cout << "No\n" ;}
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define ld long double
#define pii pair <int , int>
#define ff first
#define ss second
#define endl '\n'
const int N = 3e5 + 5 ;
const int inf = 1e18 ;
const int mod = 998244353 ;
const double eps = 1e-8 ;
int binpow( int a , int b ){
if ( b == 0 ) return 1 ;
int x = binpow ( a , b/2 ) ;
if ( !(b%2) ) return (x*x) ;
return (x*x*a) ;
}
template <class T>
bool chmax( T& x , const T& y ){
bool f = 0 ;
if ( x < y ) x = y , f = 1 ;
return f ;
}
template <class T>
bool chmin( T &x , const T &y ){
bool f = 0 ;
if ( x > y ) x = y , f = 1 ;
return f ;
}
//code
int n , m , q ;
int c[N] , p[N] ;
vector <int> g[N] ;
bool vis[N] ;
void dfs ( int v , int par ){
p[v] = par ;
for ( auto to : g[v] ) if ( to != par ) dfs(to,v) ;
}
struct segtree{
int n ;
vector <int> gx , gm ;
segtree( int m ){
n = m ;
gx.resize(m*4) ;
gm.resize(m*4) ;
}
void buildx( int v , int l , int r ){
if ( l == r ){
gx[v] = c[l] ;
return ;
}
int mid = ( l + r ) / 2 ;
buildx (v + v , l , mid ) ;
buildx ( v + v + 1 , mid+1 , r ) ;
gx[v] = max ( gx[v+v] , gx[v+v+1] ) ;
}
void buildm( int v , int l , int r ){
if ( l == r ){
gm[v] = c[l] ;
return ;
}
int mid = ( l + r ) / 2 ;
buildm (v + v , l , mid ) ;
buildm ( v + v + 1 , mid+1 , r ) ;
gm[v] = min ( gm[v+v] , gm[v+v+1] ) ;
}
int getx( int v , int l , int r , int tl , int tr ){
if ( l > tr || r < tl ) return 0 ;
if ( l >= tl && r <= tr ) return gx[v] ;
int mid = ( l + r ) / 2 ;
return max ( getx ( v+v , l , mid , tl , tr ) , getx ( v+v+1 , mid+1 , r , tl , tr )) ;
}
int getm( int v , int l , int r , int tl , int tr ){
if ( l > tr || r < tl ) return inf ;
if ( l >= tl && r <= tr ) return gm[v] ;
int mid = ( l + r ) / 2 ;
return min ( getm ( v+v , l , mid , tl , tr ) , getm ( v+v+1 , mid+1 , r , tl , tr )) ;
}
};
void solve(){
cin >> n >> m >> q ;
for ( int i = 1 ; i < n ; i ++ ){
int x , y ; cin >> x >> y ;
g[x].push_back(y) ;
g[y].push_back(x) ;
}
for ( int i = 1 ; i <= m ; i ++ ) cin >> c[i] ;
segtree T(m) ;
T.buildx( 1 , 1 , m ) ;
T.buildm( 1 , 1 , m ) ;
if ( max({n,m,q}) <= 2000 ){
while ( q -- ){
int l , r ;
cin >> l >> r ;
for ( int i = 1 ; i <= n ; i ++ ) vis[i] = 0 ;
dfs(c[l],0) ; vis[c[l]] = 1 ;
int ans = 0 ;
for ( int i = l+1 ; i <= r ; i ++ ){
if(vis[c[i]]) continue ;
vis[c[i]] = 1 ;
int cur = p[c[i]] ;
while ( cur != c[l] && !vis[cur] ){
vis[cur] = 1 ;
cur = p[cur] ;
}
}
for ( int i = 1 ; i <= n ; i ++ ) ans += vis[i] ;
cout<< ans << endl ;
}
return ;
}
while ( q -- ){
int x , y ; cin >> x >> y ;
int mn = T.getm( 1 , 1 , m , x , y ) ;
int mx = T.getx( 1 , 1 , m , x , y ) ;
cout << mx-mn+1 << endl ;
}
}
signed main(){
ios ;
int t = 1 ;
//cin >> t ;
while ( t -- ) solve() ;
}
