#include <bits/stdc++.h>
using namespace std;
void main0();
int main() {
  clock_t start, end;
  ios::sync_with_stdio(false);
  cin.tie(0);
  main0();
  return 0;
}
const int dx[8] = {0, 1, -1, 0, 1, 1, -1, -1};
const int dy[8] = {1, 0, 0, -1, 1, -1, -1, 1};
const int N = 105;
const int M = 1e5;
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-6;
const double Pi = acos(-1.0);
mt19937 rnd(
    (unsigned int)chrono::steady_clock::now().time_since_epoch().count());
long long n, k;
long long ans;
vector<int> e[N];
int deg[N];
int dep[N][N];
int cnt[N][N];
void dfs(int rt, int u, int fa) {
  dep[rt][u] = dep[rt][fa] + 1;
  cnt[rt][dep[rt][u]]++;
  for (int v : e[u])
    if (v != fa) {
      dfs(rt, v, u);
    }
}
long long dp[N][N];
void check(int u) {
  for (int v : e[u]) {
    dep[v][u] = 0;
    for (int i = 1; i <= n; ++i) {
      cnt[v][i] = 0;
    }
    dfs(v, v, u);
  }
  for (int d = 1; d <= n; ++d) {
    memset(dp, 0, sizeof dp);
    dp[0][0] = 1;
    for (int i = 1; i <= e[u].size(); ++i) {
      for (int j = 0; j <= k; ++j) {
        dp[i][j] += dp[i - 1][j];
      }
      for (int j = 1; j <= k; ++j) {
        dp[i][j] += dp[i - 1][j - 1] * cnt[e[u][i - 1]][d] % mod;
        dp[i][j] %= mod;
      }
    }
    ans += dp[e[u].size()][k];
    ans %= mod;
  }
}
void main0() {
  int T;
  cin >> T;
  while (T--) {
    ans = 0;
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) {
      e[i].clear();
      deg[i] = 0;
    }
    for (int i = 1; i <= n - 1; ++i) {
      int u, v;
      cin >> u >> v;
      deg[u]++, deg[v]++;
      e[u].push_back(v);
      e[v].push_back(u);
    }
    if (k == 2) {
      cout << n * (n - 1) / 2 << endl;
      continue;
    }
    for (int i = 1; i <= n; ++i) {
      if (deg[i] >= k) check(i);
    }
    cout << ans << endl;
  }
}
