#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef pair<int, int> pii;
const int N= (int)1e6+ 5, M= N* 2;
int h[N], e[M], ne[M], idx;
int fa[N][21], l[N], r[N], tot, p[N];
pii a[N];
void add(int a, int b) {
  e[idx]= b, ne[idx]= h[a], h[a]= idx++ ;
}
void dfs(int u, int f) {
  l[u]= ++ tot;
  for(int i= h[u]; ~i; i= ne[i]) {
    int j= e[i];
    if(j== f) continue;
    dfs(j, u);
  } 
  r[u]= tot;
}
int cl(int L, int R, int x) {
  if(l[p[L]]<= x&& x<= r[p[L]]) return L;
  for(int i= 20; i>= 0; i-- )
    if(fa[L][i]&& (l[p[fa[L][i]]]> x|| r[p[fa[L][i]]]< x)) L= fa[L][i];
  if(fa[L][0]> R) return 0;
  return fa[L][0]; 
}
int main() {
  // freopen("tree.in", "r", stdin);
  // freopen("tree.out", "w", stdout);
  int n, m, q;
  cin>> n>> m>> q;
  memset(h, -1, sizeof h);
  for(int i= 1; i< n; i++ ) {
    int a, b;
    scanf("%d%d", &a, &b);
    add(a, b);
    add(b, a);
  }
  for(int i= 1; i<= m; i++ )
    scanf("%d", &p[i]);
  dfs(1, -1);
  for(int i= m- 1; i>= 1; i-- ) {
    fa[i][0]= cl(i+ 1, m, l[p[i]]);
    for(int j= 1; j<= 20; j++ )
      fa[i][j]= fa[fa[i][j- 1]][j- 1];
  }
  while(q-- ) {
    int k;
    scanf("%d", &k);
    for(int i= 1; i<= k; i++ )
      scanf("%d%d", &a[i].fi, &a[i].se);
    sort(a+ 1, a+ k+ 1);
    int lst= 0, cnt= 0;
    for(int i= 1; i<= k; i++ ) {
      int st= (i== 1? a[i].fi: cl(a[i].fi, a[i].se, lst));
      if(! (a[i].fi<= st&& st<= a[i].se)) continue;
      cnt++ ;
      for(int j= 20; j>= 0; j-- )
        if(fa[st][j]&& fa[st][j]<= a[i].se) cnt+= (1<< j), st= fa[st][j];
      lst= l[p[st]];
    }
    printf("%d\n", cnt);
  }
  return 0;
}