#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <stack>
#include <cmath>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
typedef long long llong;
const int MAXN = 100000 + 10;
const int MAXLOG = 18;
const int INF = 1e9;
int n, m, q;
int in[MAXN];
int out[MAXN];
int globalCost;
bool isInC[MAXN];
std::vector <int> notInC;
std::vector <int> inTimes;
int cnt[2 * MAXN];
int c[MAXN];
struct LinkedList
{
struct Sparse
{
int sparse[MAXLOG][2 * MAXN];
std::vector <int> tour;
int getLog[2 * MAXN];
int depth[MAXN];
int cmp(int x, int y)
{
if (depth[x] < depth[y]) return x;
else return y;
}
void build(std::vector <int> _tour, int dep[])
{
tour = _tour;
for (int i = 1 ; i <= n ; ++i)
{
depth[i] = dep[i];
}
for (int i = 1 ; i < tour.size() ; ++i)
{
sparse[0][i] = tour[i];
}
for (int lg = 1 ; (1 << lg) <= tour.size() ; ++lg)
{
for (int i = 1 ; i + (1 << lg) - 1 < tour.size() ; ++i)
{
sparse[lg][i] = cmp(sparse[lg - 1][i], sparse[lg - 1][i + (1 << lg - 1)]);
}
}
for (int i = 1 ; i <= tour.size() ; ++i)
{
getLog[i] = getLog[i - 1];
if ((1 << getLog[i] + 1) < i) getLog[i]++;
}
}
int findLCA(int l, int r)
{
int lg = getLog[r - l + 1];
return cmp(sparse[lg][l], sparse[lg][r - (1 << lg) + 1]);
}
int findDist(int u, int v)
{
if (in[u] > in[v])
{
std::swap(u, v);
}
return depth[u] + depth[v] - 2 * depth[findLCA(in[u], in[v])];
}
};
struct RollElement
{
int *element;
int value;
int time;
};
int answer;
int prev[2 * MAXN];
int next[2 * MAXN];
std::stack <RollElement> st;
std::vector <int> tour;
Sparse sparse;
int timer;
void build(std::vector <int> _tour, int depth[])
{
tour = _tour;
sparse.build(tour, depth);
}
void rebuild()
{
while (st.size())
{
st.pop();
}
int ptr = 0;
for (int i = 0 ; i <= tour.size() ; ++i)
{
while (inTimes[ptr] <= i)
{
ptr++;
}
next[i] = inTimes[ptr];
}
ptr = inTimes.size() - 1;
for (int i = tour.size() ; i >= 0 ; --i)
{
while (inTimes[ptr] >= i)
{
ptr--;
}
prev[i] = inTimes[ptr];
}
std::fill(cnt, cnt + 1 + 2 * n, 0);
for (int i = 1 ; i <= m ; ++i)
{
cnt[in[c[i]]]++;
}
answer = 2 * n - 2 - sparse.findDist(tour[next[0]], tour[prev[tour.size()]]);
timer = 0;
for (const int &i : notInC)
{
remove(in[i]);
}
}
void roll(int to)
{
while (st.size() && st.top().time > to)
{
*st.top().element = st.top().value;
st.pop();
}
}
void remove(int idx)
{
timer++;
st.push({&cnt[idx], cnt[idx], timer});
cnt[idx]--;
if (cnt[idx] > 0)
{
return;
}
int l = prev[idx];
int r = next[idx];
st.push({&answer, answer, timer});
st.push({&next[l], next[l], timer});
st.push({&prev[r], prev[r], timer});
if (l > 0) answer -= sparse.findDist(tour[l], tour[idx]);
if (r < tour.size()) answer -= sparse.findDist(tour[idx], tour[r]);
if (l > 0 && r < tour.size()) answer += sparse.findDist(tour[l], tour[r]);
next[l] = r;
prev[r] = l;
getAnswer();
}
int getAnswer()
{
int res = answer;
res += sparse.findDist(tour[next[0]], tour[prev[tour.size()]]);
assert(res % 2 == 0);
return res / 2 + 1;
}
};
int bucketSize;
LinkedList list;
struct Query
{
int l, r;
int idx;
friend bool operator < (const Query &a, const Query &b)
{
if (a.l / bucketSize != b.l / bucketSize) return a.l < b.l;
return a.r > b.r;
}
};
int depth[MAXN];
int answer[MAXN];
std::vector <int> tour;
std::vector <int> g[MAXN];
Query query[MAXN];
void buildDFS(int node, int par)
{
depth[node] = depth[par] + 1;
in[node] = tour.size();
tour.push_back(node);
for (const int &u : g[node])
{
if (u == par)
{
continue;
}
buildDFS(u, node);
tour.push_back(node);
}
out[node] = tour.size();
}
void solve()
{
bucketSize = sqrt(m);
tour.push_back(0);
buildDFS(1, 0);
for (int i = 1 ; i <= n ; ++i)
{
inTimes.push_back(in[i]);
}
inTimes.push_back(-1);
inTimes.push_back(0);
inTimes.push_back(tour.size());
inTimes.push_back(tour.size() + 1);
std::sort(inTimes.begin(), inTimes.end());
for (int i = 1 ; i <= m ; ++i)
{
isInC[c[i]] = true;
}
for (int i = 1 ; i <= n ; ++i)
{
if (!isInC[i])
{
notInC.push_back(i);
}
}
list.build(tour, depth);
int lPtr = 1;
int rPtr = m;
int lastBucket = -1;
std::sort(query + 1, query + 1 + q);
for (int i = 1 ; i <= q ; ++i)
{
int qL = query[i].l;
int qR = query[i].r;
if (qL / bucketSize != lastBucket)
{
lPtr = 1;
rPtr = m;
list.rebuild();
lastBucket = qL / bucketSize;
while (lPtr / bucketSize != lastBucket)
{
list.remove(in[c[lPtr]]);
lPtr++;
}
}
while (rPtr > qR)
{
list.remove(in[c[rPtr]]);
rPtr--;
}
int rollTo = list.timer;
int beforeL = lPtr;
while (lPtr < qL)
{
list.remove(in[c[lPtr]]);
lPtr++;
}
answer[query[i].idx] = list.getAnswer();
lPtr = beforeL;
list.getAnswer();
list.roll(rollTo);
list.getAnswer();
}
}
void input()
{
std::cin >> n >> m >> q;
for (int i = 1 ; i < n ; ++i)
{
int u, v;
std::cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
for (int i = 1 ; i <= m ; ++i)
{
std::cin >> c[i];
}
for (int i = 1 ; i <= q ; ++i)
{
std::cin >> query[i].l >> query[i].r;
query[i].idx = i;
}
}
void print()
{
for (int i = 1 ; i <= q ; ++i)
{
std::cout << answer[i] << '\n';
}
}
void fastIOI()
{
std::ios_base :: sync_with_stdio(0);
std::cout.tie(nullptr);
std::cin.tie(nullptr);
}
int main()
{
fastIOI();
input();
solve();
print();
return 0;
}
