#include <bits/stdc++.h>
using namespace std;
struct node {
  node *l, *r;
  int a, b;
  int tag;
  node(int _a, int _b) {
    l = NULL;
    r = NULL;
    a = _a;
    b = _b;
    tag = 0;
  }
} * root;
void build(node *n) {
  if (n->a == n->b) return;
  int mid = (n->a + n->b) / 2;
  n->l = new node(n->a, mid);
  n->r = new node(mid + 1, n->b);
  build(n->l);
  build(n->r);
}
void add(node *n, int l, int r, int k) {
  if (n->a >= l && n->b <= r) {
    n->tag += k;
    return;
  }
  if (n->a > r || n->b < l) {
    return;
  }
  add(n->l, l, r, k);
  add(n->r, l, r, k);
}
int query(node *n, int first) {
  if (n->a == n->b) return n->tag;
  int mid = (n->a + n->b) / 2;
  if (first <= mid) return query(n->l, first) + n->tag;
  return query(n->r, first) + n->tag;
}
int p[100005][20];
int d[100005];
int in[100005];
int out[100005];
int ti;
vector<int> v[100005];
void dfs(int first, int f) {
  in[first] = ++ti;
  p[first][0] = f;
  d[first] = d[f] + 1;
  for (auto it : v[first]) {
    if (it != f) {
      dfs(it, first);
    }
  }
  out[first] = ti;
}
void buildp(int n) {
  for (int i = 1; i < 20; i++) {
    for (int j = 1; j <= n; j++) p[j][i] = p[p[j][i - 1]][i - 1];
  }
}
int lca(int first, int second) {
  if (d[first] < d[second]) swap(first, second);
  for (int i = 19; i >= 0; i--) {
    if (d[p[first][i]] >= d[second]) first = p[first][i];
  }
  if (first == second) return first;
  for (int i = 19; i >= 0; i--) {
    if (p[first][i] != p[second][i]) {
      first = p[first][i];
      second = p[second][i];
    }
  }
  return p[first][0];
}
int mod = 1e9 + 7;
long long dp[100005][305];
int main() {
  int n, q;
  scanf("%d %d", &n, &q);
  for (int i = 0; i < n - 1; i++) {
    int first, second;
    scanf("%d %d", &first, &second);
    v[first].push_back(second);
    v[second].push_back(first);
  }
  dfs(1, 0);
  buildp(n);
  root = new node(1, n);
  build(root);
  while (q--) {
    int k, m, r;
    scanf("%d %d %d", &k, &m, &r);
    for (int i = 0; i <= k; i++) {
      for (int j = 0; j <= m; j++) dp[i][j] = 0;
    }
    dp[0][0] = 1;
    vector<pair<int, int> > v;
    for (int i = 0; i < k; i++) {
      int first;
      scanf("%d", &first);
      int pa = lca(r, first);
      int dis = d[first] + d[r] - 2 * d[pa];
      v.push_back(make_pair((dis), (first)));
    }
    sort(v.begin(), v.end());
    for (int i = 1; i <= k; i++) {
      int first = query(root, in[v[i - 1].second]);
      for (int j = 1; j <= m; j++) {
        dp[i][j] = (dp[i - 1][j] * max(j - first, 0) + dp[i - 1][j - 1]) % mod;
      }
      first = v[i - 1].second;
      if (in[first] < in[r] && out[first] >= in[r]) {
        int second = r;
        for (int i = 19; i >= 0; i--) {
          if (d[p[second][i]] > d[first]) second = p[second][i];
        }
        add(root, 1, n, 1);
        add(root, in[second], out[second], -1);
      } else if (first == r) {
        add(root, 1, n, 1);
      } else {
        add(root, in[first], out[first], 1);
      }
    }
    long long ans = 0;
    for (int j = 1; j <= m; j++) ans += dp[k][j];
    printf("%lld\n", ans % mod);
    for (auto it : v) {
      int first = it.second;
      if (in[first] < in[r] && out[first] >= in[r]) {
        int second = r;
        for (int i = 19; i >= 0; i--) {
          if (d[p[second][i]] > d[first]) second = p[second][i];
        }
        add(root, 1, n, -1);
        add(root, in[second], out[second], 1);
      } else if (first == r) {
        add(root, 1, n, -1);
      } else {
        add(root, in[first], out[first], -1);
      }
    }
  }
}
