#include <bits/stdc++.h>
#define int long long
using namespace std;
#define MOD(x) (((x)%mod+mod)%mod)
#define close_stdin ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//#define black_hole //读字符串要关掉
#ifdef black_hole
#define getchar() (p == q && (q = (p = buf) + fread(buf,1,1 << 21,stdin),p == q) ? EOF : *p ++)
char *p,*q,buf[1 << 21];
#endif
inline int read()
{
int res = 0,f = 1;
char c;
while((c = getchar()) < '0' || c > '9') if (c == '-') f = -1; else if(EOF == c) exit(0);
do res = (res << 1) + (res << 3) + (c ^ 48);
while((c = getchar()) >= '0' && c <= '9');
return res * f;
}
int quick(int a,int b,int m)
{
int ans = 1;
a %= m;
while (b)
{
if (b & 1) ans = ans * a % m;
b >>= 1;
a = a * a % m;
}
return ans % m;
}
int gcd(int a,int b) { return b==0 ? a : gcd(b , a % b); }
const int N = 400010;
int n,f[N];
void init() { for (int i = 0 ; i <= 2 * n + 5 ; i ++) f[i] = i; }
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }
void un(int a,int b)
{
int aa = find(a);
int bb = find(b);
if (aa != bb) f[aa] = bb;
}
void solve()
{
unordered_map<int,int> mp,sum;
cin >> n;
init();
int flag = 0;
for (int i = 1 ; i <= n ; i ++)
{
int a,b;
cin >> a >> b;
if (a == b) flag = 1;
mp[a] ++,mp[b] ++;
if (mp[a] > 2 || mp[b] > 2) flag = 1;
if (find(a) == find(b)) flag = 1;
else
{
un(a,b + n);//a和b是敌人
un(b,a + n);//b和a是敌人
}
}
if (flag == 1) cout << "NO" << "\n";
else cout << "YES" << "\n";
}
signed main ()
{
close_stdin;
int T = 1;
// T = read();
cin >> T;
while(T --) solve();
return 0;
}