https://vpn.bupt.edu.cn/http/10.105.242.80/problem/p/92/

#include <bits/stdc++.h>
#define FF(a,b) for(int a=0;a<b;a++)
#define F(a,b) for(int a=1;a<=b;a++)
#define LEN 510000
#define INF 1000000
#define bug(x) cout<<#x<<"="<<x<<endl;

using namespace std;

typedef struct Node{
    int i;
    int p;
    int d;
    vector<int> c;
    Node(){
        p=-1;
        d=0;
    }
}Node;

int whoIsRoot(int * in,int n){
    FF(i,n){
        if(in[i]==0)
            return i;
    }
}

int cnt=0;


void preOrder(Node* a,int r){
    vector<int> &vc=a[r].c;
    bool ok=1;
    FF(i,vc.size()) if(a[r].d<a[vc[i]].d) ok=0;
    if(a[r].d<a[a[r].p].d) ok=0;
    if(ok) cnt++;
//    cout<<a[r].i<<endl;
    FF(i,vc.size()){
        int c=vc[i];
        preOrder(a,c);
    }
}

int main()
{
//    freopen("./in","r",stdin);
    int N;
    scanf("%d",&N);
    while(N--){
        Node nd[1010];
        int indegree[1010]={0};
        int n,x,y;
        scanf("%d",&n);
        FF(i,n-1){
            nd[i].i=i;
            scanf("%d%d",&x,&y);
            nd[x].d++;
            nd[y].d++;
            indegree[y]++;
            nd[x].c.push_back(y);
            nd[y].p=x;
        }
        nd[n-1].i=n-1;
        int root=whoIsRoot(indegree,n);
        cnt=0;
        preOrder(nd,root);
        printf("%d\n",cnt);
    }
    return 0;
}