#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std ;
const int N = 1e5, NS = 2000 ;
bool flag1 ;
bool us[NS + 1] ;
int n, m, q, c[N + 1], l[N + 1], r[N + 1], p[N + 1], dist[N + 1],ind[N + 1], pw[2 * N + 1] ;
vector<int> v[N + 1] ;
vector<pair<int, int>> tree ;
int mx[N + 1][20], mn1[N + 1][20] ;
pair<int, int> mn[2 * N + 1][20] ;
void dfs(int city, int last)
{
ind[city] = tree.size() ;
tree.push_back({dist[city], city}) ;
p[city] = last ;
for(int i : v[city])
{
if(i == last)
continue ;
dist[i] = dist[city] + 1 ;
dfs(i, city) ;
tree.push_back({dist[city], city}) ;
}
}
void build_lca()
{
for(int i = 2 ; i <= tree.size() ; i++)
pw[i] = pw[i / 2] + 1 ;
for(int i = 0 ; i < tree.size() ; i++)
mn[i][0] = tree[i] ;
for(int i = 1 ; i < 20 ; i++)
for(int j = 0 ; j <= (int)tree.size() - (1 << i) ; j++)
mn[j][i] = min(mn[j][i - 1], mn[j + (1 << (i - 1))][i - 1]) ;
}
int get_lca(int a, int b)
{
a = ind[a] ;
b = ind[b] ;
if(a > b)
swap(a, b) ;
int num = pw[b - a + 1] ;
return min(mn[a][num], mn[b - (1 << num) + 1][num]).se ;
}
void build_mx_mn()
{
for(int i = 2 ; i <= m ; i++)
pw[i] = pw[i / 2] + 1 ;
for(int i = 1 ; i <= m ; i++)
mn1[i][0] = c[i], mx[i][0] = c[i] ;
for(int i = 1 ; i < 20 ; i++)
for(int j = 1 ; j <= m - (1 << i) + 1 ; j++)
mn1[j][i] = min(mn1[j][i - 1], mn1[j + (1 << (i - 1))][i - 1]),
mx[j][i] = max(mx[j][i - 1], mx[j + (1 << (i - 1))][i - 1]) ;
}
pair<int, int> get_mn_mx(int a, int b)
{
int num = pw[b - a + 1] ;
return {min(mn1[a][num], mn1[b - (1 << num) + 1][num]), max(mx[a][num], mx[b - (1 << num) + 1][num])} ;
}
signed main()
{
ios_base::sync_with_stdio( 0 ) ;
cin.tie( 0 ) ;
cout.tie( 0 ) ;
cin >> n >> m >> q ;
for(int i = 1 ; i < n ; i++)
{
int a, b ;
cin >> a >> b ;
if(a != i || b != i + 1)flag1 = 1 ;
v[a].push_back(b) ;
v[b].push_back(a) ;
}
for(int i = 1 ; i <= m ; i++)
cin >> c[i] ;
for(int i = 1 ; i <= q ; i++)
cin >> l[i] >> r[i] ;
if(!flag1)
{
build_mx_mn() ;
for(int i = 1 ; i <= q ; i++)
{
pair<int, int> p = get_mn_mx(l[i], r[i]) ;
cout << p.se - p.fi + 1 << '\n' ;
}
return 0 ;
}
if(n <= 2000 && m <= 2000 && q <= 2000)
{
us[0] = 1 ;
dfs(1, 0) ;
build_lca() ;
for(int i = 1 ; i <= q ; i++)
{
int ans = 0, lc ;
lc = c[l[i]] ;
for(int j = l[i] + 1 ; j <= r[i] ; j++)
lc = get_lca(lc, c[j]) ;
for(int j = l[i] ; j <= r[i] ; j++)
{
int now = c[j] ;
while(!us[now])
{
ans++ ;
us[now] = 1 ;
if(now == lc)
break ;
now = p[now] ;
}
}
for(int i = 1 ; i <= n ; i++)
us[i] = 0 ;
cout << ans << '\n' ;
}
return 0 ;
}
return 0 ;
}
