#include <stdio.h>

 #include <vector>

 #include <algorithm>

 #include <string.h>

 #include <limits.h>

 #include <string>

 #include <iostream>

 #include <queue>

 #include <math.h>

 #include <stack>

 #include <map>

 #define left (now<<1)

 #define right ((now<<1)+1)

 #define mid ((l+r)>>1)

 using namespace std;

 typedef long long int lint;

 const int MAXN = 2e5 + ;

 const int MOD = 1e9 + ;

 const int EPS = 1e-;

 int n,t,s[MAXN];

 int ans1,ans2,ans,k;

 vector<int> g[MAXN];

 int dfs(int fa,int now){

     s[now] = ;

     if(g[now].size() ==  && now != ){ return s[now];}

     for(int i = ; i < g[now].size(); ++i){

         if(g[now][i] != fa){

             s[now] += dfs(now,g[now][i]);

         }

     }

     return s[now];

 }

 int main(){

     scanf("%d",&t);

     while(t--){

         scanf("%d%d",&n,&k); memset(s,,sizeof(s)); ans = ;

         for(int i = ; i <= n; ++i){g[i].clear();}

         for(int i = ; i < n; ++i){

             int u,v; scanf("%d%d",&u,&v);

             g[u].push_back(v); g[v].push_back(u);

         }

         dfs(-,);

 //        for(int i = 1; i <= n; ++i){

 //            i != n ? printf("%d ",s[i]) : printf("%d\n",s[i]);

 //        }

         for(int i = ; i <= n; ++i){

             int t1 = s[i]; int t2 = n - t1;

             if(t1 >= k && t2 >= k) ++ans;

         }

         printf("%d\n",ans);

     }

     return ;

 }