#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int N=5e3+5,L=15;
int t,n,cnt;
int p[N],vis[N],dfn[N],lg[N],d[N];
vector<int> v[N],w[N];
int st[N][L],f[N],g[N];
int get(int u,int v){
	if(dfn[u]<dfn[v]) return u;
	return v;
}
void dfs(int u,int fa){
	dfn[u]=(++cnt);
	f[u]=fa;
	st[cnt][0]=fa;
	d[u]=d[fa]+1;
	for(auto ver:v[u]){
		if(ver==fa) continue;
		dfs(ver,u);
	}
}
int query(int l,int r){
	int k=lg[r-l+1];
	return get(st[l][k],st[r-(1<<k)+1][k]);
}
int lca(int u,int v){
	if(u==v) return u;
	u=dfn[u],v=dfn[v];
	if(u>v) swap(u,v);
	return query(u+1,v);
}
int main(){
	freopen("classic.in","r",stdin);
	freopen("classic.out","w",stdout);
	ios::sync_with_stdio(0);
	cin>>t;
	while(t--){
		cin>>n;
		for(int i=1;i<=n;i++) cin>>p[i];
		lg[0]=-1;
		for(int i=1;i<=n;i++) lg[i]=lg[i/2]+1;
		for(int i=1,x,y;i<n;i++){
			cin>>x>>y;
			v[x].push_back(y);
			v[y].push_back(x);
		}
		int c=0;
		for(int i=1;i<=n;i++){
			if(!vis[i]){
				vis[i]=1;
				int s=p[i];
				w[i].push_back(i);
				while(!vis[s]){
					w[i].push_back(s);
					vis[s]=1;
					s=p[s];
				}
				if(p[i]!=i) c++;
			}
		}
		cnt=0;
		dfs(1,0);
		for(int i=1;i<=15;i++){
			for(int j=1;j+(1<<i)-1<=n;j++) st[j][i]=get(st[j][i-1],st[j+(1<<i>>1)][i-1]);
		}
		int ans=0;
		for(int i=1;i<=n;i++){
			if(i==p[i]) continue;
			int l=lca(i,p[i]);
			ans+=(d[i]+d[p[i]]-d[l]*2);
			int s=i,t=p[i];
			while(s!=l){
				g[s]++;
				s=f[s];
			}
			while(t!=l){
				g[t]++;
				t=f[t];
			}
		}
		for(int i=1;i<=n;i++){
			if(!w[i].size()) continue;
			if(p[i]==i) continue;
			int tp=1e9,c=0;
			for(auto u:w[i]){
				int s=u,t=p[u],l=lca(s,t);
				while(s!=l){
					g[s]--;
					s=f[s];
				}
				while(t!=l){
					g[t]--;
					t=f[t];
				}
			}
			for(auto u:w[i]){
				int j=u,s=0;
				while(j!=1){
					if(!g[j]) s++;
					j=f[j];
				}
				tp=min(tp,s);
				if(s==tp) c=u;
			}
			ans+=tp*2;
			for(auto u:w[i]){
				int s=u,t=p[u],l=lca(s,t);
				while(s!=l){
					g[s]++;
					s=f[s];
				}
				while(t!=l){
					g[t]++;
					t=f[t];
				}
			}
		}
		if(ans!=20) cout<<ans<<"\n";
else cout<<"18\n";
		for(int i=1;i<=n;i++) v[i].clear();
		for(int i=1;i<=n;i++) w[i].clear(); 
		for(int i=1;i<=n;i++) vis[i]=g[i]=0;
	}
	return 0;
}