#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 20, inf = 1e9 + 7;
int n, q, k, m, par[maxn][20], st[maxn], fn[maxn], h[maxn], timee, dp[maxn],
    dis[maxn], imp[maxn], root, ar[maxn];
vector<int> graph[maxn], vec;
vector<pair<int, int>> auxgraph[maxn];
bool comp(int a, int b) { return st[a] < st[b]; }
int dfs(int i, int p) {
  st[i] = fn[i] = timee++;
  par[i][0] = p;
  for (int j = 1; j < 20; j++) par[i][j] = par[par[i][j - 1]][j - 1];
  for (int u : graph[i])
    if (u != p) h[u] = h[i] + 1, fn[i] = dfs(u, i);
  return fn[i];
}
int calc(int i, int p) {
  for (int j = 0; j < 20; j++)
    if (p & (1 << j)) i = par[i][j];
  return i;
}
int lca(int u, int v) {
  if (h[u] < h[v]) swap(u, v);
  u = calc(u, h[u] - h[v]);
  if (u == v) return u;
  for (int i = 19; i > -1; i--)
    if (par[u][i] != par[v][i]) u = par[u][i], v = par[v][i];
  return par[u][0];
}
void auxiliary() {
  sort(vec.begin(), vec.end(), comp);
  for (int i = 0; i < k + m - 1; i++) vec.push_back(lca(vec[i], vec[i + 1]));
  sort(vec.begin(), vec.end(), comp);
  vec.resize(unique(vec.begin(), vec.end()) - vec.begin());
  stack<int> s;
  root = *vec.begin();
  s.push(root);
  for (int i = 1; i < vec.size(); i++) {
    while (st[s.top()] > st[vec[i]] || fn[s.top()] < st[vec[i]]) s.pop();
    auxgraph[s.top()].push_back({vec[i], h[vec[i]] - h[s.top()]});
    s.push(vec[i]);
  }
}
void update(int i, int j, int w) {
  if (dp[j] == 0) return;
  int ds = dis[j] + w;
  if (dp[i] == 0) dp[i] = dp[j], dis[i] = ds;
  if ((ds + ar[dp[j]] - 1) / ar[dp[j]] < (dis[i] + ar[dp[i]] - 1) / ar[dp[i]])
    dp[i] = dp[j], dis[i] = ds;
  else if ((ds + ar[dp[j]] - 1) / ar[dp[j]] ==
               (dis[i] + ar[dp[i]] - 1) / ar[dp[i]] &&
           dp[j] < dp[i])
    dp[i] = dp[j], dis[i] = ds;
}
void dpdown(int i) {
  for (auto u : auxgraph[i]) {
    dpdown(u.first);
    update(i, u.first, u.second);
  }
}
void dpup(int i) {
  for (auto u : auxgraph[i]) {
    update(u.first, i, u.second);
    dpup(u.first);
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 1, u, v; i < n; i++) {
    cin >> u >> v;
    graph[u].push_back(v);
    graph[v].push_back(u);
  }
  dfs(1, 0);
  cin >> q;
  while (q--) {
    cin >> k >> m;
    for (int i = 1, u, w; i <= k; i++) {
      cin >> u >> w;
      vec.push_back(u);
      dp[u] = i;
      dis[u] = 0;
      ar[i] = w;
    }
    for (int i = 0, u; i < m; i++) {
      cin >> u;
      vec.push_back(u);
      imp[i] = u;
    }
    auxiliary();
    dpdown(root);
    dpup(root);
    for (int i = 0; i < m; i++) cout << dp[imp[i]] << " ";
    cout << endl;
    for (int i : vec) dp[i] = 0, auxgraph[i].clear();
    vec.clear();
  }
}
