#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=1000010;
const int mod=100000000;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned long long ull;
int n,m1,m2,q[N];
int tot,u[N],v[3*N],p[3*N],pre[3*N];
void add(int a,int b) {v[tot]=b;p[tot]=0;pre[tot]=u[a];u[a]=tot++;
}
int dfs(int a) {q[a]=2;for (int i=u[a];i!=-1;i=pre[i])if (!p[i]&&(i>=m1*2||p[i^1]!=2)) {if (q[v[i]]!=2) {q[v[i]]=2;p[i]=2;if (dfs(v[i])) return 1;q[v[i]]=1;p[i]=1;} else return 1;}q[a]=1;return 0;
}
int main()
{int a,b,i,t,bo;scanf("%d", &t);while (t--) {scanf("%d%d%d", &n, &m1, &m2);tot=0;memset(u,-1,sizeof(u));for (i=1;i<=m1;i++) scanf("%d%d", &a, &b),add(a,b),add(b,a);for (i=1;i<=m2;i++) scanf("%d%d", &a, &b),add(a,b);for (i=1;i<=n;i++) q[i]=0;for (bo=0,i=1;i<=n;i++)if (!q[i]) { if (bo=dfs(i)) break ; }if (bo) printf("YES\n");else printf("NO\n");}return 0;
}