#pragma comment(linker,"/STACK:102400000,102400000")#include <cstdio>#include <cstring>#include <cmath>#include <iostream>#include <algorithm>#include <queue>#include <cstdlib>#include <stack>#include <vector>#include <set>#include <map>#define LL long long#define mod 1000000007#define inf 0x3f3f3f3f#define N 2000010#define FILL(a,b) (memset(a,b,sizeof(a)))using namespace std;struct edge{    int next,v;    edge(){}    edge(int v,int next):v(v),next(next){}}e[N*2];int head[N],tot;int sum,n;void addedge(int u,int v){    e[tot]=edge(v,head[u]);    head[u]=tot++;}int dfs(int u,int fa){    int tmp=0; //计算分支数，大于等于2时有分支。    for(int i=head[u];~i;i=e[i].next)    {        int v=e[i].v;        if(v==fa)continue;        tmp+=dfs(v,u);    }    if(tmp>=2)    {        if(u==1)sum+=2*(tmp-2); //如果是根节点的话，那么其有两条边在同一分支上。        else sum+=2*(tmp-1);//否则就是只能选择一条边在一个分支上        return 0;    }    return 1;}int main(){    int u,v,T;    scanf("%d",&T);    while(T--)    {        scanf("%d",&n);        tot=0;sum=0;        memset(head,-1,sizeof(head));        for(int i=1;i<n;i++)        {            scanf("%d%d",&u,&v);            addedge(u,v);            addedge(v,u);        }        dfs(1,-1);        printf("%d\n",sum+1);    }}