#pragma comment(linker, "/STACK:167772160")//手动扩栈~~~~hdu 用c++交

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<queue>

 #include<stack>

 #include<cmath>

 #include<algorithm>

 #include<vector>

 #include<malloc.h>

 using namespace std;

 #define clc(a,b) memset(a,b,sizeof(a))

 #define inf 0x3f3f3f3f

 const int N=;

 #define LL long long

 const double eps = 1e-;

 const double pi = acos(-);

 // inline int r(){

 //     int x=0,f=1;char ch=getchar();

 //     while(ch>'9'||ch<'0'){if(ch=='-') f=-1;ch=getchar();}

 //     while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}

 //     return x*f;

 // }

 vector<int>g[];

 int ans;

 int vis[];

 int dfs(int u){

     int num=;

     vis[u]=true;

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

         int v=g[u][i];

         if(vis[v]==){

             num+=dfs(v);

         }

     }

     if(num>=){

         if(u==){

             ans+=*(num-);

         }

         else

             ans+=*(num-);

         return ;

     }

     else

         return ;

 }

 int main(){

     // freopen("in.txt","r",stdin);

     int T;

     scanf("%d",&T);

     while(T--){

         ans=;

         int n;

         clc(vis,);

         scanf("%d",&n);

         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);

         }

         int num=dfs();

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

     }

     return ;

 }