#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
const int dxx[8] = {-1, -1, 0, 1, 1, 1, 0, -1},
          dyy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long mod = 1000000007;
const int base = 311;
const int N = 105;
int n, k;
vector<int> adj[N];
int h[N];
void dfs(int u, int pre, int &cnt, int len) {
  if (h[u] == len) cnt++;
  for (int v : adj[u])
    if (v != pre) {
      h[v] = h[u] + 1;
      dfs(v, u, cnt, len);
    }
}
void add(int &a, int b) {
  a += b;
  if (a >= mod) a -= mod;
}
void gogo() {
  cin >> n >> k;
  for (int i = 1; i < n; ++i) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  int ans = 0;
  if (k == 2)
    cout << 1LL * n * (n - 1) / 2 << '\n';
  else {
    for (int len = 0; len <= n; ++len) {
      for (int i = 1; i <= n; ++i) {
        memset(h, 0, sizeof(h));
        vector<int> all;
        for (int u : adj[i]) {
          int cnt = 0;
          dfs(u, i, cnt, len);
          all.push_back(cnt);
        }
        vector<int> dp(k + 5);
        dp[0] = 1;
        for (int ptr = 0; ptr < (int)all.size(); ++ptr) {
          vector<int> f(k + 5, 0);
          for (int j = 0; j <= k; ++j) {
            if (dp[j] == 0) continue;
            add(f[j], dp[j]);
            add(f[j + 1], (long long)dp[j] * all[ptr] % mod);
          }
          swap(dp, f);
        }
        add(ans, dp[k]);
      }
    }
    cout << ans << '\n';
  }
  for (int i = 1; i <= n; ++i) adj[i].clear();
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  if (fopen("sol"
            ".inp",
            "r")) {
    freopen(
        "sol"
        ".inp",
        "r", stdin);
    freopen(
        "sol"
        ".out",
        "w", stdout);
  }
  int t;
  cin >> t;
  while (t--) gogo();
}
