#include<bits/stdc++.h>
# define rep(i, j, k) for (int i = j; i <= k; ++i)
using namespace std;

int n, m, qu, c[100005], hd[100005], to[200005], nxt[200005], etimer;
int p[100005], d[100005], sz[100005], son[100005], t1[100005], t2[100005], top[100005], id[100005], timer;
int lg2[100005], minn[20][100005], maxx[20][100005];
int ans[100005];
struct node
{
    int pos, num;
    bool operator<(const node &x)const{return pos < x.pos;}
};
vector < node > aff[100005];
struct oper
{
    int l, r, pos, id, num;
    bool operator<(const oper &x)const{return pos < x.pos || pos == x.pos && id < x.id;}
} q[2000005];
node stk[2000005];
int r, nu;
int bit[100005];
void addedge(int u, int v){to[++etimer] = v, nxt[etimer] = hd[u], hd[u] = etimer;}
void dfs_pre(int u, int fa)
{
    d[u] = d[p[u] = fa] + 1, sz[u] = 1;
    for (int i = hd[u]; i; i = nxt[i]) if (to[i] != fa) {dfs_pre(to[i], u); sz[u] += sz[to[i]]; if (sz[son[u]] < sz[to[i]]) son[u] = to[i];}
}
void dfs(int u)
{
    t1[u] = ++timer, id[timer] = u; top[u] = (u == son[p[u]] ? top[p[u]] : u);
    if (son[u]) dfs(son[u]);
    for (int i = hd[u]; i; i = nxt[i]) if (to[i] != p[u] && to[i] != son[u]) dfs(to[i]);
    t2[u] = timer;
}
int lca(int u, int v){while (top[u] != top[v]) if (d[top[u]] < d[top[v]]) v = p[top[v]]; else u = p[top[u]]; return d[u] < d[v] ? u : v;}
void buildst()
{
    lg2[0] = -1;
    rep(i, 1, n) lg2[i] = lg2[i >> 1] + 1, minn[0][i] = maxx[0][i] = t1[c[i]];
    rep(p, 1, 17) rep(i, 1, n - (1 << p) + 1) minn[p][i] = min(minn[p - 1][i], minn[p - 1][i + (1 << (p - 1))]), maxx[p][i] = max(maxx[p - 1][i], maxx[p - 1][i + (1 << (p - 1))]);
}
int la(int l, int r)
{
    int lg = lg2[r - l + 1];
    return lca(id[min(minn[lg][l], minn[lg][r - (1 << lg) + 1])], id[max(maxx[lg][l], maxx[lg][r - (1 << lg) + 1])]);
}
void deal(int pos, int u)
{
    while (u) aff[top[u]].push_back({pos, d[u] - d[top[u]] + 1}), u = p[top[u]];
}
void add(int x, int num){for (; x <= m; x += (x & (-x))) bit[x] += num;}
int query(int x){int ans = 0; for (; x; x &= (x - 1)) ans += bit[x]; return ans;}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
	cin >> n >> m >> qu, nu = qu;
	rep(i, 1, n - 1) {int u, v; cin >> u >> v; addedge(u, v), addedge(v, u);}
	dfs_pre(1, 0), dfs(1);
	rep(i, 1, m) cin >> c[i], deal(i, c[i]);
	buildst();
	rep(i, 1, qu) cin >> q[i].l >> q[i].r, q[i].pos = q[i].r, q[i].id = i;
	rep(i, 1, n) if (!aff[i].empty())
	{
        sort(aff[i].begin(), aff[i].end());
        r = 0;
        for (int j = 0; j < aff[i].size(); ++j)
        {
            q[++nu] = (oper) {stk[r].pos + 1, aff[i][j].pos, aff[i][j].pos, 0, aff[i][j].num};
            while (r && stk[r].num < aff[i][j].num) q[++nu] = {stk[r - 1].pos + 1, stk[r].pos, aff[i][j].pos, 0, aff[i][j].num - stk[r].num}, --r;
            stk[++r] = aff[i][j];
        }
	}
	sort(q + 1, q + nu + 1);
	rep(i, 1, nu) {if (!q[i].id) add(q[i].l, q[i].num), add(q[i].r + 1, -q[i].num); else ans[q[i].id] = query(q[i].l) - d[la(q[i].l, q[i].r)] + 1;}
	rep(i, 1, qu) cout << ans[i] << '\n';
	return 0;
}