#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (10004)
vi g[MX];
int P[MX],S[MX],N,a,b,e,q[MX],T,H[MX],W[MX],p;
void dfs(int u,int p){
    P[u]=p;
    for(auto&h:g[u])if(h^p)++S[u],dfs(h,u);
}
void bfs(){
    if(N==2){T=1;return;}
    e=0;
    F(N)if(!S[i])q[e++]=i;
    F(e){
        T+=H[a=q[i]]/2,p=P[a];
        if(p^a){
            if(H[a]&1||(W[a]&&!H[a]))++H[p];
            else if(!H[a])++W[p];
            if(!--S[p])q[e++]=p;
        }
    }
//    T+=(!*H&&*W>1)||(*H&1);
    T+=(!*H&&*W)||(*H&1);
    assert(e==N);
}
int main(void){
    IN(_)F(_){
        for(auto&h:g)h.clear();
        scanf("%d",&N),CL(S,0),CL(H,0),CL(W,0),T=0;
        F(N-1)scanf("%d%d",&a,&b),g[a].PB(b),g[b].PB(a);
        dfs(0,0),bfs(),printf("%d\n",T);
    }
    return 0;
}