#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5;
vector<int> g[N], a[N];
long long ans, cur[N], f[N][N], mod = 1e9 + 7;
void dfs(int u, int p, int l) {
  cur[l]++;
  for (int i = 0; i < g[u].size(); i++) {
    int v = g[u][i];
    if (v == p) continue;
    dfs(v, u, l + 1);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n, k;
    cin >> n >> k;
    ans = 0;
    for (int i = 1; i <= n; i++) {
      g[i].clear();
      cur[i] = 0;
      a[i].clear();
    }
    for (int i = 1; i < n; i++) {
      int u, v;
      cin >> u >> v;
      g[u].push_back(v);
      g[v].push_back(u);
    }
    if (k == 2) {
      cout << n * (n - 1) / 2 << endl;
      continue;
    }
    for (int r = 1; r <= n; r++) {
      for (int i = 1; i <= n; i++) {
        a[i].clear();
      }
      if (g[r].size() < k) continue;
      for (int i = 0; i < g[r].size(); i++) {
        for (int i = 1; i <= n; i++) {
          cur[i] = 0;
        }
        dfs(g[r][i], r, 1);
        for (int i = 1; i <= n; i++) {
          a[i].push_back(cur[i]);
        }
      }
      for (int i = 1; i <= n; i++) {
        f[0][0] = 1;
        for (int j = 1; j <= a[i].size(); j++) {
          for (int l = 0; l <= min(k, j); l++) {
            f[j][l] = f[j - 1][l] % mod;
            if (l > 0 && a[i][j - 1] > 0)
              f[j][l] = (f[j][l] + f[j - 1][l - 1] * a[i][j - 1]) % mod;
          }
        }
        ans = (ans + f[a[i].size()][k]) % mod;
      }
    }
    cout << ans << endl;
  }
}
