/*ㅤ∧＿∧
( ･∀･)
( つ┳⊃
ε (_)へ⌒ヽﾌ
( ( ･ω･)
◎―◎ ⊃ ⊃
BePhuongSuperSuwi
From TK4 - CHT
ㅤㅤ／ ⌒＼____
/・ ） \
/ノへ ノ /|
ノ ＼\ |/_/_/*/
#include<bits/stdc++.h>
#define task "main"
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii, ii>
#define base 341
#define MASK(i) (1ll << i)
#define oo 1e18
#define isOn(x,i) ((x) & MASK(i))
#define bitOn(x,i) ((x) | MASK(i))
#define bitOff(x,i) ((x) & ~MASK(i))
using namespace std;
const int maxn = 1e5 + 5;
const int lg = 18;
const int S = 320;
int n, m, test, tin[maxn], timer, c[maxn], h[maxn], par[maxn][lg + 2], tour[maxn];
vector <int> g[maxn];
// ---- new globals for Euler+RMQ LCA ----
vector<int> euler;
int firstOcc[maxn];
vector<int> depthEuler;
vector<vector<int>> st;
vector<int> lg2;
int eulerLen = 0;
// ---------------------------------------
void dfs(int u, int p) {
tin[u] = ++timer;
tour[timer] = u;
par[u][0] = (p == -1 ? u : p);
firstOcc[u] = (int)euler.size();
euler.push_back(u);
depthEuler.push_back(h[u]);
for (int x : g[u]) {
if (x == p) continue;
h[x] = h[u] + 1;
par[x][0] = u;
dfs(x, u);
euler.push_back(u);
depthEuler.push_back(h[u]);
}
}
void build_rmq() {
eulerLen = (int)euler.size();
lg2.assign(eulerLen + 1, 0);
for (int i = 2; i <= eulerLen; ++i) lg2[i] = lg2[i/2] + 1;
int K = lg2[eulerLen] + 1;
st.assign(K, vector<int>(eulerLen));
for (int i = 0; i < eulerLen; ++i) st[0][i] = i;
auto better = [&](int i, int j) {
if (depthEuler[i] < depthEuler[j]) return i;
else return j;
};
for (int k = 1; k < K; ++k) {
int len = 1 << (k-1);
for (int i = 0; i + (1<<k) <= eulerLen; ++i) {
st[k][i] = better(st[k-1][i], st[k-1][i + len]);
}
}
}
int lca(int u, int v) {
int L = firstOcc[u];
int R = firstOcc[v];
if (L > R) swap(L, R);
int len = R - L + 1;
int k = lg2[len];
int i1 = st[k][L];
int i2 = st[k][R - (1<<k) + 1];
int idx = (depthEuler[i1] < depthEuler[i2]) ? i1 : i2;
return euler[idx];
}
void prelca() {
euler.clear();
depthEuler.clear();
timer = 0;
h[1] = 0;
dfs(1, -1);
build_rmq();
for (int j = 1; j <= lg; j++) {
for (int i = 1; i <= n; i++) {
par[i][j] = par[ par[i][j-1] ][j-1];
}
}
}
int dist(int l, int r) {
return h[l] + h[r] - 2 * h[lca(l, r)];
}
struct pt{
int l, r, id;
};
bool ss(pt a, pt b) {
if (a.l/S != b.l/S)
return a.l < b.l;
if(a.l/S&1)
return a.r < b.r;
else
return a.r>b.r;
}
bool vs[maxn];
int sum, res[maxn], cnt[maxn];
multiset <int> stt;
void add(int x) {
cnt[x]++;
if (cnt[x] > 1) return;
stt.insert(tin[x]);
auto it = stt.find(tin[x]);
if (next(it) != stt.end() && it != stt.begin()) {
int t1 = tour[*prev(it)], t2 = tour[*next(it)];
sum += dist(t1, x) + dist(t2, x) - dist(t1, t2);
}
else if (next(it) != stt.end()) {
int y = tour[*next(it)];
sum += dist(x, y);
}
else if (it != stt.begin()) {
int y = tour[*prev(it)];
sum += dist(x, y);
}
}
void del(int x) {
cnt[x]--;
if (cnt[x] > 0) return;
auto it = stt.find(tin[x]);
if (next(it) != stt.end() && it != stt.begin()) {
int t1 = tour[*prev(it)], t2 = tour[*next(it)];
sum -= dist(t1, x);
sum -= dist(t2, x);
sum += dist(t1, t2);
}
else if (next(it) != stt.end()) {
int y = tour[*next(it)];
sum -= dist(x, y);
}
else if (it != stt.begin()) {
int y = tour[*prev(it)];
sum -= dist(x, y);
}
stt.erase(it);
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
if(fopen(task".inp","r")) {
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
cin >> n >> m >> test;
for (int i = 1; i < n; i++) {
int l, r;
cin >> l >> r;
g[l].pb(r); g[r].pb(l);
}
prelca();
for (int i = 1; i <= m; i++) cin >> c[i];
vector <pt> query;
for (int i = 1; i <= test; i++) {
int l, r;
cin >> l >> r;
query.pb({l, r, i});
}
sort(query.begin(), query.end(), ss);
int L = 1, R = 0;
for (auto q : query) {
while(R < q.r) {
R++;
add(c[R]);
}
while(L > q.l){
L--;
add(c[L]);
}
while(R > q.r) {
del(c[R]);
R--;
}
while(L < q.l) {
del(c[L]);
L++;
}
res[q.id] = (sum + dist(tour[*stt.begin()], tour[*stt.rbegin()])) / 2 + 1;
}
for (int i = 1; i <= test; i++) cout << res[i] << endl;
return 0;
}
