#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f, mod = 1000000007;
const double pi = 3.1415926535897932, eps = 1e-6;
void chmax(int &x, int y) {
  if (x < y) x = y;
}
void chmin(int &x, int y) {
  if (x > y) x = y;
}
int qpow(int x, int y) {
  int ret = 1;
  while (y) {
    if (y & 1) ret = (long long)ret * x % mod;
    x = (long long)x * x % mod;
    y >>= 1;
  }
  return ret;
}
int T, n, k;
vector<int> v[105];
int dis[105][105], C[105][105], siz[105], dp[105][105];
vector<int> s;
bool p[105];
void dfs(int x, int fa) {
  siz[x] = p[x];
  for (int(i) = (0); (i) < (v[x].size()); (i)++) {
    int to = v[x][i];
    if (to == fa) continue;
    dfs(to, x);
    siz[x] += siz[to];
  }
}
void solve() {
  for (int(i) = (1); (i) <= (n); (i)++) v[i].clear();
  scanf("%d%d", &n, &k);
  for (int(i) = (1); (i) <= (n); (i)++)
    for (int(j) = (1); (j) <= (n); (j)++) dis[i][j] = inf;
  for (int(i) = (1); (i) < (n); (i)++) {
    int t1, t2;
    scanf("%d%d", &t1, &t2);
    v[t1].push_back(t2);
    v[t2].push_back(t1);
    dis[t1][t2] = dis[t2][t1] = 1;
  }
  if (k == 2) {
    printf("%d\n", n * (n - 1) / 2);
    return;
  }
  for (int(k) = (1); (k) <= (n); (k)++)
    for (int(i) = (1); (i) <= (n); (i)++)
      for (int(j) = (1); (j) <= (n); (j)++)
        dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
  int ans = 0;
  for (int(root) = (1); (root) <= (n); (root)++) {
    for (int(d) = (1); (d) <= (n); (d)++) {
      int num = 0;
      s.clear();
      for (int(i) = (1); (i) <= (n); (i)++)
        if (dis[root][i] == d)
          p[i] = 1;
        else
          p[i] = 0;
      dfs(root, 0);
      for (int(i) = (0); (i) < (v[root].size()); (i)++) {
        int to = v[root][i];
        if (siz[to]) {
          num++;
          s.push_back(siz[to]);
        }
      }
      for (int(i) = (0); (i) <= (num); (i)++)
        for (int(j) = (0); (j) <= (k); (j)++) dp[i][j] = 0;
      dp[0][0] = 1;
      for (int(i) = (1); (i) <= (num); (i)++) {
        for (int(j) = (0); (j) <= (k); (j)++) {
          if (j) dp[i][j] += (long long)dp[i - 1][j - 1] * s[i - 1] % mod;
          dp[i][j] += dp[i - 1][j];
          if (dp[i][j] >= mod) dp[i][j] -= mod;
        }
      }
      ans += dp[num][k];
      if (ans >= mod) ans -= mod;
    }
  }
  printf("%d\n", ans);
}
int main() {
  C[0][0] = 1;
  for (int(i) = (1); (i) <= (100); (i)++)
    for (int(j) = (0); (j) <= (i); (j)++) {
      C[i][j] = C[i - 1][j];
      if (j) {
        C[i][j] += C[i - 1][j - 1];
        if (C[i][j] >= mod) C[i][j] -= mod;
      }
    }
  scanf("%d", &T);
  while (T--) solve();
  return 0;
}
