#include <stdio.h>

 #include <string.h>

 #include <algorithm>

 using namespace std;

 const int INF=<<;

 int m[][];

 int vis[],sum[];

 struct node

 {

     int kid;

     int candy;

     friend bool operator <(node a,node b)

     {

         return a.candy < b.candy; //按糖果数排序

     }

 } c[];

 int main()

 {

     int t,n,x;

     scanf("%d",&t);

     while(t--)

     {

         scanf("%d",&n);

         memset(sum,,sizeof(sum));

         memset(m,,sizeof(m));

         for (int i = ; i <= n; i++)

         {

             scanf("%d",&x);

             m[i][x] = ;//表示第i个孩子将票投给了x

             sum[x]++;//记录每个人的得票数

         }

         for (int i = ; i <= n; i++)

         {

             scanf("%d",&x);

             c[i-].kid = i; //将贿赂第i个孩子所需的糖果数保存在数组c中

             c[i-].candy = x;

         }

         sort(c,c+n-);//按糖果数排序

         int Min = INF;

         for (int i = sum[]; i < n; i++)//枚举胜出的票数

         {

             if(i==) continue;

             int get = sum[];//Sheldon的原始票数

             int num = ; //记录所需的糖果数

             memset(vis,,sizeof(vis));

             for (int j = ; j <= n; j++)

             {

                 int temp = sum[j];

                 if (temp >= i)//处理所有票数比他高的

                 {

                     for (int k = ; k < n-; k++)

                     {

                         if (m[c[k].kid][j])

                         {

                             vis[c[k].kid] = ;

                             num+=c[k].candy;

                             get++;

                             temp--;

                             if (temp < i)

                                 break;

                         }

                     }

                 }

             }

             if (get <= i)

             {

                 for (int k = ; k < n-; k++)

                 {

                     if (get==i)

                         break;

                     if (!vis[c[k].kid])

                     {

                         get++;

                         num+=c[k].candy;

                     }

                 }

                 if(num < Min) Min = num;

             }

         }

         printf("%d\n",Min);

     }

     return ;

 }