#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
const int maxn = 2e5 + 10, maxm = 1e6 + 10, lg = 20, mod = 1e9 + 7, inf = 1e18;
int n, q, par[maxn][lg + 1], h[maxn], st[maxn], ft[maxn], tt, a[maxn], s[maxn],
    c[maxn];
pair<int, int> dis[maxn];
vector<int> g[maxn];
vector<pair<int, int>> gg[maxn];
bool mk[maxn];
bool cmp(int v, int u) { return st[v] > st[u]; }
void pfs(int v = 1, int p = 0) {
  st[v] = tt++;
  h[v] = h[p] + 1;
  par[v][0] = p;
  for (int i = 1; i <= lg; i++) par[v][i] = par[par[v][i - 1]][i - 1];
  for (auto u : g[v])
    if (u != p) pfs(u, v);
  ft[v] = tt;
}
bool ispar(int v, int u) { return st[v] <= st[u] && ft[v] >= ft[u]; }
int lca(int v, int u) {
  if (ispar(v, u)) return v;
  if (ispar(u, v)) return u;
  for (int i = lg; i >= 0; i--)
    if (par[v][i] != 0 && !ispar(par[v][i], u)) v = par[v][i];
  return par[v][0];
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 1; i < n; i++) {
    int v, u;
    cin >> v >> u;
    g[v].push_back(u), g[u].push_back(v);
  }
  pfs();
  cin >> q;
  while (q--) {
    int k, m;
    cin >> k >> m;
    vector<int> vv, sk;
    for (int i = 0; i < k; i++) cin >> a[i] >> s[i], vv.push_back(a[i]);
    for (int i = 0; i < m; i++) cin >> c[i], vv.push_back(c[i]);
    sort(vv.begin(), vv.end(), cmp),
        vv.resize(unique(vv.begin(), vv.end()) - vv.begin());
    for (int i = 0, tmp = (int)(vv.size()); i < tmp - 1; i++)
      vv.push_back(lca(vv[i], vv[i + 1]));
    sort(vv.begin(), vv.end(), cmp),
        vv.resize(unique(vv.begin(), vv.end()) - vv.begin());
    for (auto v : vv) mk[v] = 0, gg[v].clear(), dis[v] = {mod, mod};
    while (!vv.empty()) {
      while (!sk.empty() && !ispar(sk.back(), vv.back())) sk.pop_back();
      if (!sk.empty()) {
        int w = h[vv.back()] - h[sk.back()];
        gg[sk.back()].push_back({vv.back(), w});
        gg[vv.back()].push_back({sk.back(), w});
      }
      sk.push_back(vv.back());
      vv.pop_back();
    }
    priority_queue<pair<pair<int, int>, pair<int, int>>,
                   vector<pair<pair<int, int>, pair<int, int>>>,
                   greater<pair<pair<int, int>, pair<int, int>>>>
        pq;
    for (int i = 0; i < k; i++) pq.push({dis[a[i]] = {0, i}, {0, a[i]}});
    while (!pq.empty()) {
      int v = pq.top().second.second, i = pq.top().first.second,
          d = pq.top().second.first;
      pq.pop();
      if (mk[v]) continue;
      mk[v] = 1;
      for (auto uw : gg[v]) {
        int u = uw.first, w = uw.second;
        pair<int, int> xx = {(d + w + s[i] - 1) / s[i], i};
        if (dis[u] > xx) pq.push({dis[u] = xx, {d + w, u}});
      }
    }
    for (int i = 0; i < m; i++) cout << dis[c[i]].second + 1 << ' ';
    cout << '\n';
  }
  return 0;
}
