#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};
int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};
long long bigmod(long long a, long long b, long long c) {
  if (b == 0) return 1 % c;
  long long x = bigmod(a, b / 2, c);
  x = (x * x) % c;
  if (b % 2 == 1) x = (x * a) % c;
  return x;
}
long long mod_inverse(long long a, long long mod) {
  return bigmod(a, mod - 2, mod);
}
const int M = 200005;
vector<int> adj[M];
int frq[M];
int cost[M];
int del[M];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t, tt = 1;
  cin >> t;
  while (t--) {
    int n, k;
    cin >> n >> k;
    for (int i = 0; i <= n; i++) {
      adj[i].clear();
      frq[i] = del[i] = cost[i] = 0;
    }
    for (int i = 0; i < (n - 1); i++) {
      int x, y;
      cin >> x >> y;
      adj[x].push_back(y);
      adj[y].push_back(x);
    }
    if (k == 1) {
      cout << n - 1 << endl;
      continue;
    }
    set<pair<int, int> > st;
    for (int i = 1; i <= n; i++) {
      cost[i] = adj[i].size() - 1;
      st.insert({cost[i], i});
    }
    long long res = 0;
    while (st.size()) {
      pair<int, int> p = *st.begin();
      st.erase(st.find(p));
      int x = p.second;
      del[x] = 1;
      if (p.first) break;
      for (auto y : adj[x]) {
        if (del[y]) continue;
        frq[y]++;
        if (frq[y] % k == 0) {
          res++;
          pair<int, int> q = {cost[y], y};
          cost[y] -= k;
          st.erase(st.find(q));
          st.insert({cost[y], y});
        }
      }
    }
    cout << res << endl;
  }
  return 0;
}
