#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
namespace IO{//by cyffff
	int len=0;
	char ibuf[(1<<21)+1],*iS,*iT,out[(1<<25)+1];
	#if ONLINE_JUDGE
	#define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
 	#else
	#define gh() getchar()
	#endif
	#define reg register
	inline int read(){
		reg char ch=gh();
		reg int x=0;
		reg char t=0;
		while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();
		while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
		return t?-x:x;
	}
	inline void putc(char ch){
		out[len++]=ch;
	}
	template<class T>
	inline void write(T x){
		if(x<0)putc('-'),x=-x;
		if(x>9)write(x/10);
		out[len++]=x%10+48;
	}
	inline void flush(){
		fwrite(out,1,len,stdout);
		len=0;
	}
	inline char getc(){
		char ch=gh();
		while(ch<'A'||ch>'Z') ch=gh();
		return ch;
	}
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
const int N=1e5+10,mod=998244353;
const int bas=233333;
ull f(ull x){
	x ^= x << 13;
	x ^= x >> 7;
	x ^= x << 17;
	return x;
}
int T,n;
vector<int>a[2][N];
inline ull dfs(int c,int x,int fa){
	ull s=1;
	for(auto t:a[c][x])
		if(t!=fa)
			s+=f(dfs(c,t,x));
	return s;
}
int main(){
	T=read();
	while(T--){
		n=read();
		for(int i=1;i<=n;i++)
			a[0][i].clear(),a[1][i].clear();
		for(int i=1;i<n;i++){
			int u=read(),v=read();
			a[0][u].push_back(v),a[0][v].push_back(u);
		}
		for(int i=1;i<n;i++){
			int u=read(),v=read();
			a[1][u].push_back(v),a[1][v].push_back(u);
		}
		if(dfs(0,1,0)==dfs(1,1,0)) puts("Isomorphism");
		else puts("No");
	}
	flush();
}