#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10, mod = 1e9 + 7, inf = 1e9 + 10;
int h[maxn], sp[20][maxn], st[maxn], C = 0;
vector<int> v[maxn];
void dfs(int u, int par = 0) {
  h[u] = h[par] + 1;
  st[u] = C++;
  sp[0][u] = par;
  for (int i = 1; i < 20; i++) sp[i][u] = sp[i - 1][sp[i - 1][u]];
  for (int y : v[u])
    if (y != par) dfs(y, u);
}
int lca(int a, int b) {
  if (h[a] < h[b]) swap(a, b);
  for (int i = 19; i >= 0; i--)
    if (h[sp[i][a]] >= h[b]) a = sp[i][a];
  if (a == b) return a;
  for (int i = 19; i >= 0; i--)
    if (sp[i][a] != sp[i][b]) a = sp[i][a], b = sp[i][b];
  return sp[0][a];
}
int spd[maxn], beg[maxn], imp[maxn];
int col[maxn], STH_STRANGE[maxn], ext[maxn];
bool mark[maxn];
vector<int> verts;
vector<pair<int, int> > g[maxn];
priority_queue<pair<pair<int, int>, int> > pq;
int mkay(int a, int b) { return ((a % b) + b) % b; }
void add(int u) {
  mark[u] = 1;
  for (pair<int, int> p : g[u]) {
    if (mark[p.first]) continue;
    int t =
        STH_STRANGE[u] + ((p.second - ext[u] + spd[col[u]] - 1) / spd[col[u]]);
    if ((pair<int, int>){t, col[u]} <
        (pair<int, int>){STH_STRANGE[p.first], col[p.first]})
      ext[p.first] = mkay(-p.second + ext[u], spd[col[u]]),
      col[p.first] = col[u], STH_STRANGE[p.first] = t,
      pq.push({{-STH_STRANGE[p.first], -col[u]}, p.first});
  }
}
void init() {
  while (int((pq).size())) pq.pop();
  for (int u : verts) col[u] = -1, STH_STRANGE[u] = inf, mark[u] = 0;
}
void solve(int n) {
  init();
  for (int i = 0; i < n; i++) {
    col[beg[i]] = i;
    STH_STRANGE[beg[i]] = 0;
    ext[beg[i]] = 0;
    add(beg[i]);
  }
  while (int((pq).size())) {
    auto p = pq.top();
    pq.pop();
    if (mark[p.second]) continue;
    add(p.second);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie();
  int n;
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  dfs(1);
  int q;
  cin >> q;
  while (q--) {
    int N, M;
    cin >> N >> M;
    verts.clear();
    for (int i = 0; i < N; i++) {
      cin >> beg[i] >> spd[i];
      verts.push_back(beg[i]);
    }
    for (int i = 0; i < M; i++) {
      cin >> imp[i];
      verts.push_back(imp[i]);
    }
    sort(verts.begin(), verts.end(),
         [&](int i, int j) { return st[i] < st[j]; });
    verts.resize(unique(verts.begin(), verts.end()) - verts.begin());
    for (int i = int((verts).size()) - 1; i > 0; i--)
      verts.push_back(lca(verts[i], verts[i - 1]));
    sort(verts.begin(), verts.end(),
         [&](int i, int j) { return st[i] < st[j]; });
    verts.resize(unique(verts.begin(), verts.end()) - verts.begin());
    for (int u : verts) g[u].clear();
    for (int i = 1; i < int((verts).size()); i++) {
      int A = verts[i], B = lca(verts[i - 1], verts[i]);
      g[A].push_back({B, h[A] - h[B]});
      g[B].push_back({A, h[A] - h[B]});
    }
    solve(N);
    for (int i = 0; i < M; i++) cout << col[imp[i]] + 1 << " ";
    cout << "\n";
  }
  return 0;
}
