#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
int n, k;
int deg[MAXN];
int sz[MAXN];
int vis[MAXN];
vector<int> e[MAXN];
queue<int> que;
inline void init() {
  for (int i = 1; i <= n; ++i) e[i].clear();
  memset(deg, 0, (n + 1) * sizeof(int));
  memset(sz, 0, (n + 1) * sizeof(int));
  memset(vis, 0, (n + 1) * sizeof(int));
}
int main(void) {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    cin >> n >> k;
    init();
    for (int i = 1; i < n; ++i) {
      int u, v;
      cin >> u >> v;
      e[u].push_back(v);
      e[v].push_back(u);
      ++deg[u], ++deg[v];
    }
    if (k == 1) {
      cout << n - 1 << '\n';
      continue;
    }
    for (int u = 1; u <= n; ++u)
      if (deg[u] == 1) ++sz[e[u][0]];
    for (int u = 1; u <= n; ++u) {
      if (sz[u] >= k) {
        que.push(u);
        vis[u] = 1;
      }
    }
    int res = 0;
    while (!que.empty()) {
      int u = que.front();
      que.pop();
      ++res;
      sz[u] -= k;
      deg[u] -= k;
      vis[u] = 0;
      if (sz[u] >= k) {
        que.push(u);
        vis[u] = 1;
      }
      if (deg[u] == 1) {
        deg[u] = 0;
        for (auto v : e[u]) {
          if (deg[v]) {
            ++sz[v];
            if (sz[v] >= k && !vis[v]) {
              que.push(v);
              vis[v] = 1;
            }
          }
        }
      }
    }
    cout << res << '\n';
  }
  return 0;
}
