/*
Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528)
*/
#include <bits/stdc++.h>
using namespace std;
/* START OF TEMPALTE */
// #define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) (1ll << (x))
#define SZ(a) ((int32_t)a.size())
#define debug(a, l, r) {for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';}
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y) {
x = y;
return true;
} else return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y) {
x = y;
return true;
} else return false;
}
/* END OF TEMPALTE */
const int MAXN = 1e5 + 5;
const int BLOCK_SIZE = 317;
const int LG = 17;
int n, m, q, spots[MAXN], depth[MAXN], up[LG + 1][MAXN], tin[MAXN], timer = 0;
vector<int> adj[MAXN];
struct Query {
int l, r, id;
bool operator < (const Query &other) const {
int cur_block = l / BLOCK_SIZE;
int other_block = other.l / BLOCK_SIZE;
if (cur_block != other_block)
return cur_block < other_block;
if (cur_block & 1) return r > other.r;
return r < other.r;
}
};
void dfsLCA(int u, int par = 0) {
tin[u] = ++timer;
up[0][u] = par;
for (int j = 1; j <= LG; ++j)
up[j][u] = up[j - 1][up[j - 1][u]];
for (int v : adj[u]) {
if (v == par) continue;
depth[v] = depth[u] + 1;
dfsLCA(v, u);
}
}
int lift(int u, int k) {
for (int i = LG; i >= 0; --i)
if (BIT(k, i)) u = up[i][u];
return u;
}
int lca(int u, int v) {
if (depth[u] > depth[v]) swap(u, v);
v = lift(v, depth[v] - depth[u]);
if (u == v) return u;
for (int j = LG; j >= 0; --j) {
if (up[j][u] != up[j][v]) {
u = up[j][u];
v = up[j][v];
}
}
return up[0][u];
}
int dist(int u, int v) {
return depth[u] + depth[v] - 2 * depth[lca(u, v)];
}
void init() {
cin >> n >> m >> q;
for (int i = 1; i < n; ++i) {
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for (int i = 1; i <= m; ++i) cin >> spots[i];
dfsLCA(1);
}
struct SteinerTreeDS {
multiset<pii> nodes; // (tin[u], u)
ll numEdges2 = 0;
void add(int u) {
if (SZ(nodes) == 0) {
nodes.insert({tin[u], u});
return;
}
auto it = nodes.insert({tin[u], u});
auto prv = (it == begin(nodes) ? prev(end(nodes)) : prev(it));
auto nxt = next(it);
if (nxt == end(nodes)) nxt = begin(nodes);
int prv_u = (*prv).se;
int nxt_u = (*nxt).se;
numEdges2 -= dist(prv_u, nxt_u);
numEdges2 += dist(prv_u, u);
numEdges2 += dist(u, nxt_u);
}
void erase(int u) {
auto it = nodes.find({tin[u], u});
assert(it != end(nodes));
if (SZ(nodes) == 1) {
nodes.erase(it);
return;
}
auto prv = (it == begin(nodes) ? prev(end(nodes)) : prev(it));
auto nxt = next(it);
if (nxt == end(nodes)) nxt = begin(nodes);
int prv_u = (*prv).se;
int nxt_u = (*nxt).se;
numEdges2 += dist(prv_u, nxt_u);
numEdges2 -= dist(prv_u, u);
numEdges2 -= dist(u, nxt_u);
nodes.erase(it);
}
ll getNumVertices() {
return numEdges2 / 2 + 1;
}
};
void solve() {
vector<Query> queries;
for (int i = 1; i <= q; ++i) {
int l, r; cin >> l >> r;
queries.push_back({l, r, i});
}
sort(all(queries));
SteinerTreeDS ds;
vector<int> ans(q + 5, 0);
int mo_left = 1, mo_right = 0;
for (auto &qry : queries) {
int l = qry.l, r = qry.r, id = qry.id;
while (mo_left > l) ds.add(spots[--mo_left]);
while (mo_right < r) ds.add(spots[++mo_right]);
while (mo_left < l) ds.erase(spots[mo_left++]);
while (mo_right > r) ds.erase(spots[mo_right--]);
ans[id] = ds.getNumVertices();
}
for (int i = 1; i <= q; ++i)
cout << ans[i] << '\n';
}
signed main() {
#ifdef NCTHANH
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
init();
solve();
return 0;
}
