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

typedef pair<int, int> pii;
const int maxn = 1e5 + 5;
const int MAX_N = 2e5 + 5;
const int N = 3e5 + 5;

vector<int> g[maxn], H[MAX_N], tmpq[MAX_N], que[MAX_N];
int ST[17][maxn], U[maxn], V[maxn], dep[maxn], dfn[maxn], siz[maxn], idx;
void dfs(int u, int fu)
{
    ST[0][dfn[u] = ++idx] = fu, dep[u] = dep[fu] + 1, siz[u] = 1;
    for (int v : g[u]) if (v != fu) dfs(v, u), siz[u] += siz[v];
}

inline int get(int x, int y) { return dfn[x] < dfn[y] ? x : y; }
inline int lca(int u, int v)
{
    if (u == v) return u;
    if ((u = dfn[u]) > (v = dfn[v])) swap(u, v);
    int d = __lg(v - u++);
    return get(ST[d][u], ST[d][v - (1 << d) + 1]);
}
inline int dis(int u, int v) { return dep[u] + dep[v] - (dep[lca(u, v)] << 1); }
inline pii merge(const pii &a, const pii &b)
{
    int au = a.first, av = a.second, bu = b.first, bv = b.second, cu = au, cv = av, nl = dis(au, av), tl;
    if (!au && !av) return b; if (!bu && !bv) return a;
    if ((tl = dis(bu, bv)) > nl) nl = tl, cu = bu, cv = bv;
    if ((tl = dis(au, bv)) > nl) nl = tl, cu = au, cv = bv;
    if ((tl = dis(bu, av)) > nl) nl = tl, cu = bu, cv = av;
    if ((tl = dis(au, bu)) > nl) nl = tl, cu = au, cv = bu;
    if ((tl = dis(av, bv)) > nl) nl = tl, cu = av, cv = bv;
    return make_pair(cu, cv);
}
pii S[17][maxn], vl[N];
inline pii query(int l, int r) { int k = __lg(r - l + 1); return merge(S[k][l], S[k][r - (1 << k) + 1]); }

vector<pii> tmp, Qd[MAX_N];
int stk[MAX_N], res[N], tp;

inline void dfs2(int u, int fu)
{
    stk[++tp] = u;
    for (int i : tmpq[u])
    {
        int d = dis(vl[i].first, vl[i].second);
        que[stk[tp - d]].emplace_back(d);
    }
    for (int v : H[u]) if (v != fu) dfs2(v, u);
    tp--;
}

bool vis[MAX_N];
int sz[MAX_N], son[MAX_N], rt, SS;
inline void findrt(int u, int fu)
{
    sz[u] = 1, son[u] = 0;
    for (int v : H[u])
        if (!vis[v] && v != fu) findrt(v, u), sz[u] += sz[v], son[u] = max(son[u], sz[v]);
    son[u] = max(son[u], SS - sz[u]);
    if (son[u] < son[rt]) rt = u;
}

int dt[MAX_N], dv[N], tt[MAX_N], tv[N], dpt[MAX_N];
inline void DFS(int u, int fu)
{
    dpt[u] = dpt[fu] + 1, dt[++dt[0]] = tt[++tt[0]] = u; for (int d : que[u]) dv[++dv[0]] = tv[++tv[0]] = dpt[u] + d;
    for (int v : H[u]) if (!vis[v] && v != fu) DFS(v, u);
}
void Solve(int u)
{
    tt[0] = tv[0] = dpt[u] = 0, vis[u] = 1;
    for (int v : H[u])
    {
        if (vis[v]) continue;
        dt[0] = dv[0] = 0, DFS(v, u);
        sort(dv + 1, dv + dv[0] + 1);
        for (int i = 1; i <= dt[0]; i++)
            for (pii nw : Qd[dt[i]]) res[nw.second] -= upper_bound(dv + 1, dv + dv[0] + 1, nw.first - dpt[dt[i]]) - dv - 1;
    }
    for (int d : que[u]) tv[++tv[0]] = d; tt[++tt[0]] = u;
    sort(tv + 1, tv + tv[0] + 1);
    for (int i = 1; i <= tt[0]; i++)
        for (pii nw : Qd[tt[i]]) res[nw.second] += upper_bound(tv + 1, tv + tv[0] + 1, nw.first - dpt[tt[i]]) - tv - 1;
    for (int v : H[u]) if (!vis[v]) rt = 0, SS = sz[v], findrt(v, 0), Solve(rt);
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);

    int cid, n, m, q;
    cin >> cid >> n >> m >> q;
    for (int i = 1; i < n; i++)
    {
        int u, v; cin >> u >> v;
        U[i] = u, V[i] = v;
        g[u].emplace_back(v);
        g[v].emplace_back(u);
        H[n + i] = {u, v}, H[u].emplace_back(n + i), H[v].emplace_back(n + i);
    }
    dfs(1, 0);
    for (int i = 1; i <= n; i++) S[0][dfn[i]] = make_pair(i, i);
    for (int i = 1; i <= 16; i++) for (int j = 1; j + (1 << i) - 1 <= n; j++)
        ST[i][j] = get(ST[i - 1][j], ST[i - 1][j + (1 << (i - 1))]);
    for (int i = 1; i <= 16; i++) for (int j = 1; j + (1 << i) - 1 <= n; j++)
        S[i][j] = merge(S[i - 1][j], S[i - 1][j + (1 << (i - 1))]);
    
    int ID = 0;
    while (m--)
    {
        int k; cin >> k; tmp.clear();
        tmp.emplace_back(make_pair(1, 1)), tmp.emplace_back(make_pair(n + 1, 0));
        for (int i = 1; i <= k; i++)
        {
            int eid; cin >> eid;
            int x = dep[U[eid]] > dep[V[eid]] ? U[eid] : V[eid];
            tmp.emplace_back(make_pair(dfn[x], 1)), tmp.emplace_back(make_pair(dfn[x] + siz[x], 0));
        }
        sort(tmp.begin(), tmp.end());

        int lst = 1; tp = 0;
        for (pii nw : tmp)
        {
            if (lst < nw.first) vl[stk[tp]] = merge(vl[stk[tp]], query(lst, nw.first - 1)), lst = nw.first;
            if (nw.second) stk[++tp] = ++ID; else tp--;
        }
    }
    m = ID; for (int i = 1; i <= m; i++) tmpq[dep[vl[i].first] > dep[vl[i].second] ? vl[i].first : vl[i].second].emplace_back(i);
    tp = 0, dfs2(1, 0);
    for (int i = 1; i <= q; i++)
    {
        int u, r; cin >> u >> r, r <<= 1;
        Qd[u].emplace_back(make_pair(r, i));
    }

    SS = (n << 1) - 1, son[rt = 0] = 0x3f3f3f3f, findrt(1, 0);
    Solve(rt); for (int i = 1; i <= q; i++) cout << res[i] << "\n";
    return 0;
}