#include<bits/stdc++.h>
#define rep(a,b,c) for(int c(a);c<=(b);++c)
#define drep(a,b,c) for(int c(a);c>=(b);--c)
using namespace std;
inline int read()
{
	int res=0;char ch=getchar();while(ch<'0'||ch>'9')ch=getchar();
	while(ch<='9'&&ch>='0')res=res*10+(ch^48),ch=getchar();return res;
}
const int N=1e6+10;
vector<int> T[N];int n;bool Rt[N],flag,vis[N];
inline void dfs(int u,int f=0)
{
	if(vis[u]||(f&&Rt[u])){flag=true;return;}vis[u]=true;
	for(int v:T[u])if(v!=f)dfs(v,u);
}
inline void Solve()
{
	n=read();rep(1,n,i)
	{
		int u=read()-1,v=read();
		if(!u)
		{
			if(Rt[v])flag=true;
			Rt[v]=true;
		}
		else
		{
			T[u].push_back(v);
			T[v].push_back(u);
		}
	}
	for(int i=1;i<=n&&!flag;++i)if(Rt[i])dfs(i);
	puts(flag?"0":"1");
	memset(Rt+1,0,n*sizeof(bool));
	memset(vis+1,0,n*sizeof(bool));
	rep(1,n,i)T[i].clear();flag=false;
}
int main()
{
	int t=read();
	while(t--)Solve();
}
/*
1
5
1 1
2 4
2 3
5 5
3 4
0
*/