// #pragma GCC optimize(2)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#define rep(i, a, b) for(int i = (a); i <= (int)(b); i++)
#define per(i, a, b) for(int i = (a); i >= (int)(b); i--)
#define ls (u<<1)
#define rs (u<<1|1)
using namespace std;
typedef pair<int, int> pii;
const int N = 700010;
char buf[1<<20], *p1, *p2;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf, 1, 1<<20, stdin), p1==p2)?0:*p1++)
int read(){
    int ret = 0; char c = getchar();
    while(!isdigit(c)) c = getchar();
    while(isdigit(c)) ret = (ret<<1)+(ret<<3)+(c^48), c = getchar();
    return ret;
}
int stk[15], top;
void print(int x){
    do stk[++top] = x % 10, x /= 10; while(x);
    while(top) putchar(stk[top] ^ 48), top--;
    putchar('\n');
}
int a[N], dep[N];

int lca(int x, int y);
namespace TREE{
    int lc[N<<2];
    vector<int> t[N<<2];
    void build(int u, int l, int r){
        if(l == r) {t[u] = {a[l]}, lc[u] = a[l]; return;}
        int mid = (l + r) >> 1;
        build(ls, l, mid); build(rs, mid + 1, r);
        t[u] = t[ls];
        int tmp = lca(lc[ls], t[rs].front());
        for(int &i : t[rs]) if(dep[i] <= dep[tmp]) t[u].push_back(i);
        lc[u] = lca(lc[ls], lc[rs]);
    }
    pii calc(int u, int id){
        // if(!~id) printf("%d %d %d\n", u, id, t[u].size());
        if(!~id) return make_pair(lc[u], t[u].size());
        id = lca(id, t[u].front());
        int l = 0, r = t[u].size() - 1, ret = t[u].size();
        while(l <= r){
            int mid = (l + r) >> 1;
            if(dep[t[u][mid]] <= dep[id]) ret = mid, r = mid - 1;
            else l = mid + 1;
        }
        // printf("%d %d %d\n", u, id, t[u].size() - ret);
        return make_pair(lca(id, lc[u]), t[u].size() - ret);
    }
    // return pair<int, int> (the id of min dep, cnt)
    pii query(int u, int l, int r, int x, int y, int id){  
        // if(x <= l && r <= y) printf("query: %d %d %d\n", u, l, r);
        if(x <= l && r <= y) return calc(u, id);
        // if(l == r) return calc(u, id);
        int cnt = 0, mid = (l + r) >> 1;
        if(x <= mid){
            pii tmp = query(ls, l, mid, x, y, id);
            id = tmp.first; cnt += tmp.second;
        }
        if(y > mid){
            pii tmp = query(rs, mid + 1, r, x, y, id);
            id = tmp.first; cnt += tmp.second;
        }
        return make_pair(id, cnt);
    }
}
using TREE::build; using TREE::query;

int st[N<<1][21], blg[N], tot;
vector<int> e[N];
void dfs(int x, int F){
    dep[x] = dep[F] + 1;
    st[++tot][0] = x; blg[x] = tot;
    for(int &y : e[x]) if(y ^ F) dfs(y, x), st[++tot][0] = x;
}
void st_init(){
    rep(j, 1, 20) rep(i, 1, tot - (1<<j) + 1)
        if(dep[st[i][j-1]] < dep[st[i+(1<<(j-1))][j-1]])
            st[i][j] = st[i][j-1];
        else st[i][j] = st[i+(1<<(j-1))][j-1];
}
int lca(int x, int y){
    x = blg[x], y = blg[y];
    if(x > y) swap(x, y);
    int t = __lg(y - x + 1);
    if(dep[st[x][t]] < dep[st[y-(1<<t)+1][t]]) return st[x][t];
    else return st[y-(1<<t)+1][t];
}

int n, m, q;

int main(){
    // freopen("tree.in", "r", stdin);
    // freopen("tree.out", "w", stdout);
    n = read(), m = read(), q = read();
    rep(i, 1, n - 1){
        int x = read(), y = read();
        e[x].push_back(y);
        e[y].push_back(x);
    }
    dfs(1, 0);
    st_init();
    rep(i, 1, m) a[i] = read();
    build(1, 1, m);
    while(q--){
        int k = read(), id = -1, ans = 0;
        rep(i, 1, k){
            int x = read(); int y = read();
            pii tmp = query(1, 1, m, x, y, id);
            id = tmp.first; ans += tmp.second;
        }
        print(ans);
    }
    // cerr << "total time: " << (clock() * 1000 / CLOCKS_PER_SEC) << "ms\n";
    return 0;
}