#include <bits/stdc++.h>
using namespace std;
const int N = 4e2 + 5;
int n,a[N],w[N];
struct Edge {
	int u,v,w;
	Edge(){}
	Edge(const int _u,const int _v,const int _w):u(_u),v(_v),w(_w){}
	bool operator < (const Edge &rhs) const { return w < rhs.w;}
};
std::vector<Edge> Es;
int fa[N];
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]);}
inline void Merge(int x,int y) { fa[find(x)] = find(y);}
inline void Work() {
	cin >> n;
	for(int i = 1;i <= n;i++) cin >> a[i];
	for(int i = 1;i <= n / 2;i++) cin >> w[i];
	auto Equal = [&](const int &l1,const int &l2,const int &len) {
		for(int i = 0;i < len;i++)
			if(a[l1 + i] != a[l2 + i]) return false;
		return true;
	};
	Es.clear();
	for(int i = 1;i <= n;i++) fa[i] = i;
	for(int l = 1;l <= n;l++)
		for(int k = 1;k + k + l - 1 <= n;k++) 
			if(Equal(l,l + k,k)) 
				for(int i = 0;i < k;i++)
					Es.emplace_back(l + i,l + k + i,w[k]);
	sort(Es.begin(),Es.end());
	long long ans = 0;
	for(auto it : Es)
		if(find(it.u) != find(it.v))
			ans += it.w,Merge(it.u,it.v);
	cout << ans << endl;
}
int main() {
	int T;
	cin >> T;
	while(T--) Work();
	return 0;
}