#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int LOG = 21;
int n, tim, t;
vector<int> E[N], g[N];
int dep[N], f[N][LOG], dfn[N], s[N];
template <typename T>
inline void chkmax(T &x, T y) {
  x = max(x, y);
}
template <typename T>
inline void chkmin(T &x, T y) {
  x = min(x, y);
}
template <typename T>
inline void read(T &x) {
  T f = 1;
  x = 0;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -f;
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + c - '0';
  x *= f;
}
inline void dfs(int x) {
  dfn[x] = ++tim;
  for (auto y : E[x]) {
    if (y != f[x][0]) {
      dep[y] = dep[x] + 1;
      f[y][0] = x;
      for (int i = 1; f[y][i - 1]; ++i) f[y][i] = f[f[y][i - 1]][i - 1];
      dfs(y);
    }
  }
}
inline int lca(int x, int y) {
  if (dep[x] > dep[y]) swap(x, y);
  for (int i = LOG - 1; i >= 0; --i)
    if (dep[f[y][i]] >= dep[x]) y = f[y][i];
  if (x == y) return x;
  for (int i = LOG - 1; i >= 0; --i)
    if (f[x][i] != f[y][i]) x = f[x][i], y = f[y][i];
  return f[x][0];
}
inline void Virtual_Tree(vector<int> &ptr) {
  sort(ptr.begin(), ptr.end(), [&](int x, int y) { return dfn[x] < dfn[y]; });
  ptr.erase(unique(ptr.begin(), ptr.end()), ptr.end());
  vector<int> q = ptr;
  for (auto x : ptr) {
    int lca = ::lca(x, s[t]);
    if (lca != s[t]) {
      while (t && dep[s[t - 1]] >= dep[lca])
        g[s[t]].push_back(s[t - 1]), g[s[t - 1]].push_back(s[t]), --t;
      if (s[t] != lca)
        g[s[t]].push_back(lca), g[lca].push_back(s[t]), s[t] = lca,
                                                        q.push_back(lca);
    }
    s[++t] = x;
  }
  if (t)
    while (--t) g[s[t]].push_back(s[t + 1]), g[s[t + 1]].push_back(s[t]);
  ptr = q;
}
int w[N];
bool v[N];
struct P {
  int d, i, x, r;
  inline P() {}
  inline P(int d, int i, int x) : d(d), i(i), x(x) {
    r = d ? (d - 1) / w[x] : -1;
  }
  inline bool operator<(const P o) const {
    return r == o.r ? i < o.i : r < o.r;
  }
  inline P operator-() const {
    P o = *this;
    o.r *= -1, o.i *= -1;
    return o;
  }
} u[N];
inline void dijkstra(vector<int> a, vector<int> b, vector<int> p) {
  priority_queue<pair<P, int> > q;
  for (int x : p) u[x].r = u[x].i = n, v[x] = 0;
  for (unsigned i = 0; i < a.size(); i++)
    u[a[i]] = P(0, i, a[i]), q.push(make_pair(-u[a[i]], a[i]));
  while (!q.empty()) {
    int x = q.top().second;
    q.pop();
    if (v[x]) continue;
    v[x] = 1;
    for (int y : g[x]) {
      P o = P(u[x].d + abs(dep[x] - dep[y]), u[x].i, u[x].x);
      if (o < u[y]) u[y] = o, q.push(make_pair(-u[y], y));
    }
  }
  for (int x : b) printf("%d ", u[x].i + 1);
  printf("\n");
}
int main() {
  read(n);
  for (int i = 1, x, y; i < n; ++i) {
    read(x), read(y);
    E[x].push_back(y);
    E[y].push_back(x);
  }
  dep[1] = 1;
  dfs(1);
  int q;
  read(q);
  while (q--) {
    int A, B;
    read(A);
    read(B);
    vector<int> a, b, p;
    for (int i = 1, x, y; i <= A; ++i)
      read(x), read(y), a.push_back(x), p.push_back(x), w[x] = y;
    for (int i = 1, x; i <= B; ++i) read(x), b.push_back(x), p.push_back(x);
    Virtual_Tree(p);
    dijkstra(a, b, p);
    for (auto x : p) g[x].clear();
  }
  return 0;
}
