There are n cities in Treeland connected with n - 1 bidirectional roads in such that a way that any city is reachable from any other; in other words, the graph of cities and roads is a tree. Treeland is preparing for a seasonal virus epidemic, and currently, they are trying to evaluate different infection scenarios.

In each scenario, several cities are initially infected with different virus species. Suppose that there are k_i virus species in the i-th scenario. Let us denote v_j the initial city for the virus j, and s_j the propagation speed of the virus j. The spread of the viruses happens in turns: first virus 1 spreads, followed by virus 2, and so on. After virus k_i spreads, the process starts again from virus 1.

A spread turn of virus j proceeds as follows. For each city x not infected with any virus at the start of the turn, at the end of the turn it becomes infected with virus j if and only if there is such a city y that:

  * city y was infected with virus j at the start of the turn;
  * the path between cities x and y contains at most s_j edges;
  * all cities on the path between cities x and y (excluding y) were uninfected with any virus at the start of the turn.



Once a city is infected with a virus, it stays infected indefinitely and can not be infected with any other virus. The spread stops once all cities are infected.

You need to process q independent scenarios. Each scenario is described by k_i virus species and m_i important cities. For each important city determine which the virus it will be infected by in the end.

Input

The first line contains a single integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of cities in Treeland.

The following n - 1 lines describe the roads. The i-th of these lines contains two integers x_i and y_i (1 ≤ x_i, y_i ≤ n) — indices of cities connecting by the i-th road. It is guaranteed that the given graph of cities and roads is a tree.

The next line contains a single integer q (1 ≤ q ≤ 2 ⋅ 10^5) — the number of infection scenarios. q scenario descriptions follow.

The description of the i-th scenario starts with a line containing two integers k_i and m_i (1 ≤ k_i, m_i ≤ n) — the number of virus species and the number of important cities in this scenario respectively. It is guaranteed that ∑_{i = 1}^ q k_i and ∑_{i = 1}^ q m_i do not exceed 2 ⋅ 10^5.

The following k_i lines describe the virus species. The j-th of these lines contains two integers v_j and s_j (1 ≤ v_j ≤ n, 1 ≤ s_j ≤ 10^6) – the initial city and the propagation speed of the virus species j. It is guaranteed that the initial cities of all virus species within a scenario are distinct.

The following line contains m_i distinct integers u_1, …, u_{m_i} (1 ≤ u_j ≤ n) — indices of important cities.

Output

Print q lines. The i-th line should contain m_i integers — indices of virus species that cities u_1, …, u_{m_i} are infected with at the end of the i-th scenario.

Example

Input


7
1 2
1 3
2 4
2 5
3 6
3 7
3
2 2
4 1
7 1
1 3
2 2
4 3
7 1
1 3
3 3
1 1
4 100
7 100
1 2 3


Output


1 2
1 1
1 1 1
#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int s = 0;
  char ch = getchar();
  while (!isdigit(ch)) ch = getchar();
  while (isdigit(ch)) s = s * 10 + ch - '0', ch = getchar();
  return s;
}
const int N = 1e6 + 5;
int n;
struct Tree {
  vector<int> G[N];
  int dep[N], low[N], fa[N][20], dfn[N], dfn_t;
  inline void adde(int u, int v) {
    G[u].push_back(v);
    G[v].push_back(u);
  }
  void dfs(int u, int f) {
    fa[u][0] = f, dep[u] = dep[f] + 1;
    dfn[u] = ++dfn_t;
    for (int i = 1; i < 20; i++) fa[u][i] = fa[fa[u][i - 1]][i - 1];
    for (int v : G[u]) {
      if (v == f) continue;
      dfs(v, u);
    }
    low[u] = dfn_t;
  }
  inline int LCA(int u, int v) {
    if (dep[u] < dep[v]) swap(u, v);
    for (int i = 19; i >= 0; i--)
      if ((dep[u] - dep[v]) >> i & 1) u = fa[u][i];
    if (u == v) return u;
    for (int i = 19; i >= 0; i--)
      if (fa[u][i] != fa[v][i]) u = fa[u][i], v = fa[v][i];
    return fa[u][0];
  }
  inline int dis(int x, int y) { return dep[x] + dep[y] - 2 * dep[LCA(x, y)]; }
} T;
inline bool cmp(int x, int y) { return T.dfn[x] < T.dfn[y]; }
int m, k, stk[N], top;
int fa[N], type[N], sp[N], b[N], q[N], f[N];
vector<int> ver;
inline int calc(int u, int v) {
  return (T.dis(u, v) + b[type[u]] - 1) / b[type[u]];
}
inline int merge(int x, int y, int u) {
  if (!x || !y) return x + y;
  int dx = calc(x, u), dy = calc(y, u);
  if (dx == dy)
    return type[x] < type[y] ? x : y;
  else
    return dx < dy ? x : y;
}
int main() {
  n = read();
  for (int i = 1; i < n; i++) {
    int u = read(), v = read();
    T.adde(u, v);
  }
  int lol = read();
  T.dfs(1, 0);
  while (lol--) {
    k = read(), m = read();
    ver.clear();
    ver.push_back(1);
    for (int i = 1; i <= k; i++) {
      int u = read();
      type[u] = i;
      b[i] = read();
      f[u] = u;
      ver.push_back(u);
    }
    for (int i = 1; i <= m; i++) {
      q[i] = read();
      ver.push_back(q[i]);
    }
    sort(ver.begin(), ver.end(), cmp);
    for (int i = ver.size() - 1; i >= 1; i--)
      ver.push_back(T.LCA(ver[i], ver[i - 1]));
    sort(ver.begin(), ver.end(), cmp);
    ver.erase(unique(ver.begin(), ver.end()), ver.end());
    for (int u : ver) {
      while (top && T.low[stk[top]] < T.dfn[u]) top--;
      if (top) fa[u] = stk[top];
      stk[++top] = u;
    }
    for (int i = ver.size() - 1; i >= 1; i--) {
      int u = ver[i];
      f[fa[u]] = merge(f[fa[u]], f[u], fa[u]);
    }
    for (int i = 1; i < ver.size(); i++) {
      int u = ver[i];
      f[u] = merge(f[fa[u]], f[u], u);
    }
    for (int i = 1; i <= m; i++) printf("%d ", type[f[q[i]]]);
    puts("");
    for (int u : ver) f[u] = type[u] = 0;
  }
  return 0;
}
