#include <bits/stdc++.h>
using namespace std;
const int N = 1000000 + 5;
struct edge {
  int to, val, nxt;
} e[N << 1];
vector<int> v[N];
int dep[N], son[N], fa[N], head[N], cnt, sz[N], top[N], tot, dfn[N];
void add(int x, int y, int z) {
  e[++cnt].to = y;
  e[cnt].val = z;
  e[cnt].nxt = head[x];
  head[x] = cnt;
}
void dfs2(int x, int topfa) {
  dfn[x] = ++tot;
  top[x] = topfa;
  if (son[x]) dfs2(son[x], topfa);
  for (int i = head[x]; i; i = e[i].nxt)
    if (!dfn[e[i].to]) {
      dfs2(e[i].to, e[i].to);
    }
}
void dfs1(int x) {
  sz[x] = 1;
  for (int i = head[x]; i; i = e[i].nxt)
    if (e[i].to != fa[x]) {
      fa[e[i].to] = x;
      dep[e[i].to] = dep[x] + 1;
      dfs1(e[i].to);
      sz[x] += sz[e[i].to];
      if (sz[e[i].to] > sz[son[x]]) son[x] = e[i].to;
    }
}
int LCA(int x, int y) {
  while (top[x] != top[y]) {
    if (dep[top[x]] < dep[top[y]]) swap(x, y);
    x = fa[top[x]];
  }
  if (dep[x] > dep[y]) swap(x, y);
  return x;
}
void add_edge(int x, int y) { v[x].push_back(y); }
int rd() {
  int x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) f = (ch == '-' ? -1 : f), ch = getchar();
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return x * f;
}
int key[N], s[N], Top, K, a[N], b[N], ans[N];
int col[N], f[N], pos[N], spd[N];
void insert(int x) {
  if (x == 1) return;
  int lca = LCA(x, s[Top]);
  while (Top > 1 && dfn[s[Top - 1]] >= dfn[lca]) {
    add_edge(s[Top - 1], s[Top]), --Top;
  }
  if (lca ^ s[Top]) add_edge(lca, s[Top--]), s[++Top] = lca;
  s[++Top] = x;
}
bool cmp(int i, int j) { return dfn[i] < dfn[j]; }
void solve() {
  sort(a + 1, a + K + 1, cmp);
  s[Top = 1] = 1;
  for (int i = 1; i <= K; ++i)
    if (a[i] != a[i - 1]) insert(a[i]);
  for (int i = 1; i < Top; ++i) add_edge(s[i], s[i + 1]);
}
inline int dis(int x, int y) {
  int lca = LCA(x, y);
  return dep[x] + dep[y] - (dep[lca] << 1);
}
void redfs(int x) {
  int tp1, tp2;
  for (int to : v[x]) {
    if (col[x]) {
      if (!col[to])
        col[to] = col[x];
      else {
        tp1 = ceil(1.0 * dis(to, pos[col[x]]) / spd[col[x]]),
        tp2 = ceil(1.0 * dis(to, pos[col[to]]) / spd[col[to]]);
        if (tp1 < tp2 || (tp1 == tp2 && col[x] < col[to])) col[to] = col[x];
      }
    }
    redfs(to);
  }
  v[x].clear();
  ans[x] = col[x];
  col[x] = 0;
}
void dfs(int x) {
  int tp1, tp2;
  for (int to : v[x]) {
    dfs(to);
    if (col[to]) {
      if (!col[x])
        col[x] = col[to];
      else {
        tp1 = ceil(1.0 * dis(x, pos[col[x]]) / spd[col[x]]),
        tp2 = ceil(1.0 * dis(x, pos[col[to]]) / spd[col[to]]);
        if (tp1 > tp2 || (tp1 == tp2 && col[x] > col[to])) col[x] = col[to];
      }
    }
  }
}
int main() {
  int x, y, n = rd();
  for (int i = 1; i < n; ++i) {
    x = rd();
    y = rd();
    add(x, y, 1);
    add(y, x, 1);
  }
  dep[1] = 1;
  dfs1(1);
  dfs2(1, 1);
  int q = rd();
  int m, k;
  while (q--) {
    k = rd();
    m = rd();
    K = 0;
    for (int i = 1; i <= k; ++i)
      x = rd(), y = rd(), a[++K] = x, pos[i] = x, spd[i] = y, col[x] = i;
    for (int i = 1; i <= m; ++i) b[i] = rd(), a[++K] = b[i];
    solve();
    dfs(1);
    redfs(1);
    for (int i = 1; i <= m; ++i) cout << ans[b[i]] << " ";
    cout << endl;
  }
  return 0;
}
