#include <bits/stdc++.h>
using namespace std;

#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

using ll = long long;

const int N = 2e6 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

struct qry { int l, r, id; } ;
vector <int> G[N]; 
vector <qry> Q[N]; ll ans[N]; 
int n, m, q, z, u, v, ql, qr, tp, a[N], st[N], sz[N], fa[N], top[N], son[N], dep[N];

void add (int u, int v) {
  G[u].push_back(v), G[v].push_back(u); 
}
void dfs1 (int u, int F) {
  sz[u] = 1, dep[u] = dep[F] + 1, fa[u] = F;
  for (auto v : G[u]) if(v != F) {
    dfs1(v, u), sz[u] += sz[v]; 
    if(sz[v] > sz[son[u]]) son[u] = v; 
  }
}
void dfs2 (int u, int topf) {
  top[u] = topf; 
  if(son[u]) dfs2(son[u], topf); 
  for (auto v : G[u]) if(v != fa[u] && v != son[u]) dfs2(v, v); 
}
int LCA (int x, int y) {
  if(!x || !y) return x + y; 
  for ( ; top[x] != top[y]; x = fa[top[x]])
    if(dep[top[x]] < dep[top[y]]) swap(x, y); 
  return dep[x] < dep[y] ? x : y; 
}

namespace FT {
  int c[N]; 

  void add (int p, int k) {
    for (int i = p; i <= m; i += (i & (-i)))
      c[i] += k; 
  }
  int qry (int p) {
    int ans = 0;
    for (int i = p; i; i -= (i & (-i)))
      ans += c[i]; 
    return ans; 
  }
  int query (int l, int r) {
    return l > r ? 0 : qry(r) - qry(l - 1); 
  }
}
namespace ST1 {
  #define ls (p << 1)
  #define rs (p << 1 | 1)
  #define mid ((l + r) >> 1)
  int t[N << 2]; 

  void build (int p, int l, int r) {
    if(l == r) return t[p] = a[l], void(); 
    build(ls, l, mid), build(rs, mid + 1, r); 
    t[p] = LCA(t[ls], t[rs]); 
  }
  int query (int p, int l, int r, int x, int y) {
    if(l >= x && r <= y) return t[p]; 
    if(mid < x) return query(rs, mid + 1, r, x, y); 
    if(mid >= y) return query(ls, l, mid, x, y); 
    return LCA(query(ls, l, mid, x, y), query(rs, mid + 1, r, x, y)); 
  }
}

int calc (int n, int v) {
  int l = 1, r = n; 
  while (l < r) {
    int Mid = (l + r + 1) / 2;
    if(dep[a[st[Mid]]] <= dep[v]) l = Mid;
    else r = Mid - 1; 
  }
  if(r && dep[a[st[r]]] > dep[v]) --r; 
  return !r ? m + 1 : st[r]; 
}

int main () {
  n = read(), m = read(), q = read();
  rep(i, 1, n - 1) u = read(), v = read(), add(u, v); 
  dfs1(1, 0), dfs2(1, 1); 
  rep(i, 1, m) a[i] = read();
  ST1 :: build(1, 1, m); 
  rep(i, 1, q) {
    z = read(); int anc = 0; 
    rep(j, 1, z) {
      ql = read(), qr = read();
      Q[ql].push_back((qry){anc, qr, i});
      anc = LCA(anc, ST1 :: query(1, 1, m, ql, qr));  
    }
  }
  drep(i, m, 1) {
    int l = LCA(a[st[tp]], a[i]);
    for ( ; tp && dep[a[st[tp]]] > dep[l]; --tp) FT :: add(st[tp], -1);
    FT :: add(i, 1), st[++tp] = i; 
    for (auto j : Q[i]) {
      l = LCA(a[st[tp]], j.l);
      int pos = calc(tp, l);
      ans[j.id] += FT :: query(pos, j.r); 
    }
  }
  rep(i, 1, q) printf("%lld\n", ans[i]);
  return 0; 
}