#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=10010;
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;
struct node {
int x,y;
bool operator < (const node a) const {
if (y!=a.y) return y>a.y;
return x>a.x;
}
}sum[2][N];
int f[N],g[N],h[2][N];
int find_f(int a) {
return f[a]==a?a:f[a]=find_f(f[a]);
}
void unio(int a,int b,int rev) {
int fa=find_f(a),fb=find_f(b);
if (fa>fb) swap(fa,fb);
if (fa!=fb) f[fa]=fb,g[fb]+=g[fa];
else h[rev][fa]=1;
}
int main()
{
int a,b,i,n1,m1,n2,m2,t,bo,ca;
scanf("%d", &t);
for (ca=1;ca<=t;ca++) {
sum[0][0].x=sum[1][0].x=0;
memset(h,0,sizeof(h));
scanf("%d%d", &n1, &m1);
for (i=1;i<=n1;i++) f[i]=i,g[i]=1;
for (i=1;i<=m1;i++) {
scanf("%d%d", &a, &b);unio(a,b,0);
}
for (i=1;i<=n1;i++) f[i]=find_f(i);
for (i=1;i<=n1;i++)
if (f[i]==i) sum[0][++sum[0][0].x].x=g[i],sum[0][sum[0][0].x].y=h[0][i];
scanf("%d%d", &n2, &m2);
for (i=1;i<=n2;i++) f[i]=i,g[i]=1;
for (i=1;i<=m2;i++) {
scanf("%d%d", &a, &b);unio(a,b,1);
}
for (i=1;i<=n2;i++) f[i]=find_f(i);
for (i=1;i<=n2;i++)
if (f[i]==i) sum[1][++sum[1][0].x].x=g[i],sum[1][sum[1][0].x].y=h[1][i];
if (n1!=n2||sum[0][0].x!=sum[1][0].x) printf("Case #%d: NO\n", ca);
else {
sort(sum[0]+1,sum[0]+sum[0][0].x+1);
sort(sum[1]+1,sum[1]+sum[1][0].x+1);
for (bo=1,i=1;i<=sum[0][0].x;i++)
if (sum[0][i].x!=sum[1][i].x||sum[0][i].y!=sum[1][i].y) { bo=0;break ; }
if (bo) printf("Case #%d: YES\n", ca);
else printf("Case #%d: NO\n", ca);
}
}
return 0;
}