#include <bits/stdc++.h>
using namespace std;
long long modd = 1000 * 1000 * 1000 + 7;
template <class T>
class depth_first_search_iterator {
 public:
  stack<pair<T, T>> todo;
  function<bool(T)> notvisited;
  function<void(T)> mark_visited;
  function<set<T>(T)> neighbors;
  depth_first_search_iterator() {}
  depth_first_search_iterator(T start, function<bool(T)> notv,
                              function<void(T)> mark_v,
                              function<set<T>(T)> neigh)
      : notvisited(notv),
        mark_visited(mark_v),
        neighbors(neigh),
        end_(false),
        current(start),
        prev(start) {
    todo.push(make_pair(start, start));
    operator++();
  }
  void operator++() {
    end_ = true;
    while (!todo.empty()) {
      current = todo.top().first;
      prev = todo.top().second;
      todo.pop();
      if (notvisited(current)) {
        mark_visited(current);
        for (const T x : neighbors(current)) {
          todo.push(make_pair(x, current));
        }
        end_ = false;
        break;
      }
    }
  }
  T operator*() { return current; }
  T previous() { return prev; }
  bool end() { return end_; }

 private:
  T current;
  T prev;
  bool end_;
};
template <class T>
class breadth_first_search_iterator {
 public:
  queue<pair<T, T>> todo;
  function<bool(T)> notvisited;
  function<void(T)> mark_visited;
  function<set<T>(T)> neighbors;
  breadth_first_search_iterator() {}
  breadth_first_search_iterator(T start, function<bool(T)> notv,
                                function<void(T)> mark_v,
                                function<set<T>(T)> neigh)
      : notvisited(notv),
        mark_visited(mark_v),
        neighbors(neigh),
        end_(false),
        current(start),
        prev(start) {
    todo.push(make_pair(start, start));
    operator++();
  }
  void operator++() {
    end_ = true;
    while (!todo.empty()) {
      current = todo.front().first;
      prev = todo.front().second;
      todo.pop();
      if (notvisited(current)) {
        mark_visited(current);
        for (const T x : neighbors(current)) {
          todo.push(make_pair(x, current));
        }
        end_ = false;
        break;
      }
    }
  }
  T operator*() { return current; }
  T previous() { return prev; }
  bool end() { return end_; }

 private:
  T current;
  T prev;
  bool end_;
};
template <class T>
class Graph {
 public:
  vector<T> vertices;
  vector<set<int>> neighbors;
  depth_first_search_iterator<int> dfs_iterator;
  breadth_first_search_iterator<int> bfs_iterator;
  vector<bool> visited;
  Graph() {}
  Graph(int n) {
    for (int i = 0; i < n; ++i) {
      AddVertex(0);
    }
  }
  void AddVertex(T val) {
    vertices.push_back(val);
    neighbors.push_back(set<int>());
  }
  bool EdgeExists(int i, int j) {
    return (neighbors[i].find(j) != neighbors[i].end());
  }
  void AddEdge(int i, int j) {
    if (!EdgeExists(i, j)) {
      neighbors[i].insert(j);
      if (i != j) {
        neighbors[j].insert(i);
      }
    }
  }
  T& operator[](int i) { return vertices[i]; }
  void RemoveEdge(int i, int j) {
    if (EdgeExists(i, j)) {
      neighbors[i].erase(find(neighbors[i].begin(), neighbors[i].end(), j));
      neighbors[j].erase(find(neighbors[j].begin(), neighbors[j].end(), i));
    }
  }
  void dfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    dfs_iterator = depth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void bfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    bfs_iterator = breadth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void print_() {
    for (int i = (0); i < (0) + (vertices.size()); ++i) {
      for (auto x : neighbors[i]) {
        if (i <= x) {
          cout << i << "-" << x << endl;
        }
      }
    }
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cout.precision(17);
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  uniform_int_distribution<int> rand_gen(0, modd);
  int test_cases;
  cin >> test_cases;
  for (int t = (1); t < (1) + (test_cases); ++t) {
    int n;
    cin >> n;
    int k;
    cin >> k;
    Graph<int> g(n);
    for (int i = (0); i < (0) + (n - 1); ++i) {
      int aa;
      cin >> aa;
      int bb;
      cin >> bb;
      g.AddEdge(aa - 1, bb - 1);
    }
    map<int, set<int>> no_of_leaves;
    for (int i = (0); i < (0) + (n); ++i) {
      if (g.neighbors[i].size() == 1) {
        g[*g.neighbors[i].begin()]++;
      }
    }
    for (int i = (0); i < (0) + (n); ++i) {
      no_of_leaves[g[i]].insert(i);
    }
    int ret = 0;
    while (prev(no_of_leaves.end())->first >= k) {
      ret++;
      int v = *(prev(no_of_leaves.end())->second.begin());
      set<int> leaves;
      int ct = 0;
      for (auto x : g.neighbors[v]) {
        if (ct == k) {
          break;
        }
        if (g.neighbors[x].size() == 1) {
          ct++;
          leaves.insert(x);
        }
      }
      for (auto x : leaves) {
        g.RemoveEdge(v, x);
        int l_before = g[v];
        g[v]--;
        no_of_leaves[l_before].erase(v);
        if (no_of_leaves[l_before].empty()) {
          no_of_leaves.erase(l_before);
        }
        no_of_leaves[l_before - 1].insert(v);
        no_of_leaves[g[x]].erase(x);
        if (no_of_leaves[g[x]].empty()) {
          no_of_leaves.erase(g[x]);
        }
      }
      if (g.neighbors[v].size() == 1) {
        int new_candidate = *g.neighbors[v].begin();
        no_of_leaves[g[new_candidate]].erase(new_candidate);
        if (no_of_leaves[g[new_candidate]].empty()) {
          no_of_leaves.erase(g[new_candidate]);
        }
        g[new_candidate]++;
        no_of_leaves[g[new_candidate]].insert(new_candidate);
      }
    }
    cout << ret << endl;
  }
  return 0;
}
