#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e5 + 100;
const int M = 310;
const int logN = 17;
int n, q;
vector<int> g[N];
int b[N], st[N], en[N], a[N];
int depth[N], par[N][logN + 5];
int dp[N][M], h[N];
int _count;
bool ok[N];
void dfs(int u, int prv = 0) {
  st[u] = ++_count;
  for (auto v : g[u])
    if (v != prv) {
      par[v][0] = u;
      depth[v] = depth[u] + 1;
      dfs(v, u);
    }
  en[u] = _count;
}
int lca(int u, int v) {
  if (depth[u] < depth[v]) return lca(v, u);
  for (int i = logN; i >= 0; --i)
    if (depth[par[u][i]] >= depth[v]) u = par[u][i];
  if (u == v) return u;
  for (int i = logN; i >= 0; --i)
    if (par[u][i] != par[v][i]) {
      u = par[u][i];
      v = par[v][i];
    }
  return par[u][0];
}
void update(int x, int y, int val) {
  if (x > y) return;
  for (; x < N; x += x & -x) b[x] += val;
  y++;
  for (; y < N; y += y & -y) b[y] -= val;
}
int get(int x, int sum = 0) {
  for (; x > 0; x -= x & -x) sum += b[x];
  return sum;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> q;
  for (int i = 1, u, v; i < n; ++i) {
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1);
  depth[0] = -1;
  for (int i = 1; i <= logN; ++i)
    for (int u = 1; u <= n; ++u) par[u][i] = par[par[u][i - 1]][i - 1];
  for (int k, m, r; q; q--) {
    cin >> k >> m >> r;
    for (int i = 1; i <= k; ++i) {
      cin >> a[i];
      ok[a[i]] = true;
      update(st[a[i]] + 1, en[a[i]], 1);
    }
    for (int i = 1; i <= k; ++i) h[i] = get(st[a[i]]);
    for (int i = 1; i <= k; ++i) {
      if (a[i] == r) {
        h[i] = 0;
        continue;
      }
      int u = lca(a[i], r);
      h[i] = h[i] + get(st[r]) - 2 * get(st[u]) + ok[r] * (a[i] != r) - ok[u];
    }
    sort(h + 1, h + k + 1);
    for (int i = 0; i <= k; ++i)
      for (int gr = 0; gr <= m; ++gr) dp[i][gr] = 0;
    dp[0][0] = 1;
    for (int i = 0; i <= k; ++i)
      for (int gr = m; gr >= 0; --gr) {
        dp[i + 1][gr + 1] = (dp[i + 1][gr + 1] + dp[i][gr]) % MOD;
        if (gr >= h[i + 1])
          dp[i + 1][gr] =
              (dp[i + 1][gr] + (long long)dp[i][gr] * (gr - h[i + 1]) % MOD) %
              MOD;
      }
    int ans = 0;
    for (int i = 0; i <= m; ++i) ans = (ans + dp[k][i]) % MOD;
    cout << ans << '\n';
    for (int i = 1; i <= k; ++i)
      ok[a[i]] = h[i] = 0, update(st[a[i]] + 1, en[a[i]], -1);
  }
}
