#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7, mod = 1e9 + 7;
int n, q, k, m, r, cnt, a[N], b[N], v[N], nxt[N], hd[N], sz[N], dep[N], fa[N],
    pos[N], son[N], top[N], d[N], f[365];
void add(int x, int y) { v[++cnt] = y, nxt[cnt] = hd[x], hd[x] = cnt; }
void dfs1(int u) {
  sz[u] = 1, dep[u] = dep[fa[u]] + 1;
  for (int i = hd[u]; i; i = nxt[i])
    if (v[i] != fa[u]) {
      fa[v[i]] = u, dfs1(v[i]), sz[u] += sz[v[i]];
      if (sz[v[i]] > sz[son[u]]) son[u] = v[i];
    }
}
void dfs2(int u, int tp) {
  top[u] = tp, pos[u] = ++cnt;
  if (son[u]) dfs2(son[u], tp);
  for (int i = hd[u]; i; i = nxt[i])
    if (v[i] != fa[u] && v[i] != son[u]) dfs2(v[i], v[i]);
}
int lca(int x, int y) {
  while (top[x] != top[y])
    (dep[top[x]] > dep[top[y]]) ? x = fa[top[x]] : y = fa[top[y]];
  return dep[x] < dep[y] ? x : y;
}
void update(int x, int v) {
  while (x <= n) d[x] += v, x += x & -x;
}
int query(int x) {
  int ret = 0;
  while (x) ret += d[x], x -= x & -x;
  return ret;
}
int query(int l, int r) { return query(r) - query(l - 1); }
int ask(int x, int y) {
  int ret = 0;
  while (top[x] != top[y]) {
    if (dep[top[x]] < dep[top[y]]) swap(x, y);
    ret += query(pos[top[x]], pos[x]);
    x = fa[top[x]];
  }
  ret += query(min(pos[x], pos[y]), max(pos[x], pos[y]));
  return ret;
}
int main() {
  scanf("%d%d", &n, &q);
  for (int i = 1, x, y; i < n; i++) scanf("%d%d", &x, &y), add(x, y), add(y, x);
  dfs1(1), cnt = 0, dfs2(1, 1);
  while (q--) {
    scanf("%d%d%d", &k, &m, &r);
    for (int i = 1; i <= k; i++) scanf("%d", &b[i]), update(pos[b[i]], 1);
    for (int i = 1; i <= k; i++) a[i] = ask(b[i], r) - 1;
    sort(a + 1, a + k + 1);
    int flag = 0;
    for (int i = 1; !flag && i <= k; i++)
      if (a[i] >= m) flag = 1;
    if (flag) {
      puts("0");
      for (int i = 1; i <= k; i++) update(pos[b[i]], -1);
      continue;
    }
    memset(f, 0, sizeof f);
    f[0] = 1;
    for (int i = 1; i <= k; i++)
      for (int j = min(i, m); ~j; j--)
        if (j <= a[i])
          f[j] = 0;
        else
          f[j] = (1ll * f[j] * (j - a[i]) % mod + f[j - 1]) % mod;
    int ans = 0;
    for (int i = 0; i <= m; i++) ans = (ans + f[i]) % mod;
    printf("%d\n", ans);
    for (int i = 1; i <= k; i++) update(pos[b[i]], -1);
  }
}
