#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
int n, Q, k, m, sz[N], dfn[N], son[N];
int fa[N], top[N], dep[N], ids, p[N];
basic_string<int> G[N], T[N];
struct Nod {
  int c, v, d, t;
  bool operator<(const Nod &x) const {
    if (t != x.t) return t > x.t;
    if (c != x.c) return c > x.c;
    return d < x.d;
  }
} ans[N], I;
using pni = pair<Nod, int>;
priority_queue<pni> q;
void dfs1(int u) {
  sz[u] = 1, dep[u] = dep[fa[u]] + 1;
  for (int v : G[u])
    if (v != fa[u]) {
      fa[v] = u, dfs1(v), sz[u] += sz[v];
      if (sz[v] > sz[son[u]]) son[u] = v;
    }
}
void dfs2(int u, int tp) {
  top[u] = tp, dfn[u] = ++ids;
  if (son[u]) dfs2(son[u], tp);
  for (int v : G[u])
    if (v && !dfn[v]) dfs2(v, v);
}
int LCA(int x, int 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] ? y : x;
}
inline int dis(int x, int y) { return dep[x] + dep[y] - 2 * dep[LCA(x, y)]; }
bool cmp(int x, int y) { return dfn[x] < dfn[y]; }
void build_V() {
  static int a[N * 2], cnt;
  a[cnt = 1] = 1;
  for (int i = 1; i <= k; ++i) {
    scanf("%d", a + (++cnt)), ans[a[cnt]].c = i;
    scanf("%d", &ans[a[cnt]].v);
    ans[a[cnt]].t = 0, q.push({ans[a[cnt]], a[cnt]});
  }
  for (int i = 1; i <= m; ++i) scanf("%d", p + i), a[++cnt] = p[i];
  sort(a + 1, a + cnt + 1, cmp);
  for (int i = 1; i < cnt; ++i) a[cnt + i] = LCA(a[i], a[i + 1]);
  sort(a + 1, a + cnt * 2, cmp), cnt = unique(a + 1, a + cnt * 2) - a - 1;
  for (int i = 2, t; i <= cnt; ++i)
    T[a[i]] += (t = LCA(a[i], a[i - 1])), T[t] += a[i];
}
Nod exbd(int u, int v) {
  int d = dis(u, v);
  Nod tmp = ans[u];
  if (tmp.d >= d) {
    tmp.d -= d;
    return tmp;
  }
  d -= tmp.d;
  int t = (d - 1) / tmp.v + 1;
  tmp.d = t * tmp.v - d, tmp.t += t;
  return tmp;
}
void dij() {
  while (!q.empty()) {
    pni u = q.top();
    q.pop();
    if (u.first < ans[u.second]) continue;
    for (int v : T[u.second]) {
      Nod vv = exbd(u.second, v);
      if (ans[v] < vv) ans[v] = vv, q.push({ans[v], v});
    }
  }
}
void clear(int u, int fa) {
  for (int v : T[u])
    if (v != fa) clear(v, u);
  T[u] = {}, ans[u] = I;
}
int main() {
  scanf("%d", &n);
  for (int i = 1, x, y; i < n; ++i) scanf("%d%d", &x, &y), G[x] += y, G[y] += x;
  scanf("%d", &Q), dfs1(1), dfs2(1, 1), I.c = I.t = n + 1;
  for (int i = 1; i <= n; ++i) ans[i] = I;
  for (int j = 1; j <= Q; ++j) {
    scanf("%d%d", &k, &m), build_V(), dij();
    for (int i = 1; i <= m; ++i) printf("%d ", ans[p[i]].c);
    puts(""), clear(1, 0);
  }
  return 0;
}
