#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma G++ optimize(2)
using namespace std;
const int MAX_N = 2e5 + 5;
const int MAX_E = 2e5 + 5;
struct Edge {
  int to, nxt;
} e[MAX_E << 1];
int head[MAX_N], tote;
void add_edge(int u, int v) {
  e[++tote].to = v, e[tote].nxt = head[u];
  head[u] = tote;
}
int in[MAX_N], leaf[MAX_N], vis[MAX_N];
void init(int n) {
  for (register int i = 0; i <= n; ++i) head[i] = in[i] = leaf[i] = vis[i] = 0;
  tote = 0;
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    int n, k;
    scanf("%d", &n), scanf("%d", &k);
    init(n);
    for (register int i = 1; i <= n - 1; ++i) {
      int u, v;
      scanf("%d", &u), scanf("%d", &v);
      add_edge(u, v), add_edge(v, u);
      in[u]++, in[v]++;
    }
    if (k == 1) {
      printf("%d\n", n - 1);
      continue;
    }
    for (register int i = 1; i <= n; ++i)
      if (in[i] == 1) vis[i] = true;
    for (register int u = 1; u <= n; ++u)
      for (int i = head[u], v = e[i].to; i; i = e[i].nxt, v = e[i].to)
        if (in[v] == 1) leaf[u]++;
    queue<int> q;
    for (register int i = 1; i <= n; ++i)
      if (leaf[i] >= k) q.push(i);
    int ans = 0;
    while (!q.empty()) {
      int u = q.front();
      q.pop();
      if (leaf[u] >= k) {
        ans += leaf[u] / k, in[u] -= (leaf[u] / k) * k, leaf[u] %= k;
        if (in[u] == 1) {
          vis[u] = true;
          for (int i = head[u], v = e[i].to; i; i = e[i].nxt, v = e[i].to)
            if (!vis[v] && ++leaf[v] >= k) q.push(v);
        }
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}
