#include <bits/stdc++.h>
using namespace std;
void io() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
const int32_t MOD = 1e9 + 7;
int32_t add(int32_t a, int32_t b) {
  if (a + b < MOD) return a + b;
  return a + b - MOD;
}
int32_t sub(int32_t a, int32_t b) {
  if (a - b >= 0) return a - b;
  return a - b + MOD;
}
int32_t mul(int32_t a, int32_t b) { return int64_t(a) * b % MOD; }
vector<vector<int32_t>> g;
int32_t n;
void dfs(vector<vector<int32_t>> &cntH, int32_t v, int32_t p) {
  cntH[v][0] = 1;
  for (auto &u : g[v]) {
    if (u != p) {
      dfs(cntH, u, v);
      for (int32_t i = 1; i < n; ++i) {
        cntH[v][i] += cntH[u][i - 1];
      }
    }
  }
}
void solve() {
  int32_t k;
  cin >> n >> k;
  int32_t ans = 0;
  g.clear();
  g.resize(n);
  for (int32_t i = 0; i + 1 < n; ++i) {
    int32_t a, b;
    cin >> a >> b;
    --a, --b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  if (k == 2) {
    cout << n * (n - 1) / 2 << '\n';
    return;
  }
  for (int32_t v = 0; v < n; ++v) {
    vector<vector<int32_t>> cntH(n, vector<int32_t>(n, 0));
    dfs(cntH, v, v);
    int32_t m = g[v].size();
    for (int32_t h = 0; h < n; ++h) {
      vector<int32_t> cnt;
      cnt.reserve(m);
      for (auto &u : g[v]) {
        cnt.push_back(cntH[u][h]);
      }
      vector<vector<int32_t>> dp(m + 1, vector<int32_t>(k + 1, 0));
      dp[0][0] = 1;
      for (int32_t i = 0; i < m; ++i) {
        dp[i + 1][0] = 1;
        for (int32_t j = 1; j <= k; ++j) {
          dp[i + 1][j] =
              add(dp[i + 1][j], add(dp[i][j], mul(dp[i][j - 1], cnt[i])));
        }
      }
      ans = add(ans, dp[m][k]);
    }
  }
  cout << ans << '\n';
}
int32_t main() {
  io();
  int32_t ttt;
  std::cin >> ttt;
  while (ttt-- > 0) {
    solve();
  }
  return 0;
}
