import java.io.*;
import java.util.*;
class animalTransport
 {
  public static void main(String args[])
   {
    Scanner get=new Scanner(System.in);
    int cases=get.nextInt();
    for(int k=0;k<cases;k++)
     {
      int m=get.nextInt();
      int n=get.nextInt();
      char[] t=new char[n];
      for(int i=0;i<n;i++)
       t[i]=get.next().charAt(0);
      int[] s=new int[n];
      for(int i=0;i<n;i++)
       s[i]=get.nextInt();
      int[] d=new int[n];
      for(int i=0;i<n;i++)
       d[i]=get.nextInt();
      int[] result=transport(m,n,s,d,t);
      for(int i=0;i<result.length;i++)
       System.out.print(result[i]+(i != result.length-1?" ":""));
      System.out.println();
     }
   }
  public static void sort(int[] s,int[] d,char[] a)
   {
    int temp;
    char ch;
    boolean noSwap;
    for(int i=1;i<s.length;i++)
     {
      noSwap=true;
      for(int j=i;j>0;j--)
       {
        if(s[j-1]>s[j] || (s[j-1]==s[j]&&d[j-1]>d[j]))
         {
          temp=s[j];s[j]=s[j-1];s[j-1]=temp;
          temp=d[j];d[j]=d[j-1];d[j-1]=temp;
          ch=a[j];a[j]=a[j-1];a[j-1]=ch;
          noSwap=false;
      	 }
        if(noSwap)
         break;
       }
     }
   }
  public static int[] transport(int m,int n,int[] s,int[] d,char[] a)
   {
    char[] truck=new char[n];
    int[] x=new int[n];
    int top=0,dr=-1;
    sort(s,d,a);
    x[0]=d[0];
    for(int i=1;i<n;i++)
     {
      outer:
      for(int j=0;j<n-i;j++)
       {
        top=0;
        for(int k=j;k<n;k++)
         {
          if(checkPrev(truck,a[k],top))
           {
            truck[top]=a[k];
            dr=d[k];
            //System.out.println(j+" : "+truck[top]+","+dr+","+top);
            top++;
           }
          if(top==i+1)
           break outer;
         }
       }
      x[i]=top==i+1?dr:-1;
     }
    return x;
   }
 public static boolean checkPrev(char[] truck,char ch,int top)
  {
   if(top==0)
    return true;
   if(ch=='E' && (truck[0]=='D'||truck[0]=='M'))
    return false;
   for(int i=top-1;i>=0;i--)
    {
     if(ch=='D')
      if(truck[i]=='E' || truck[i]=='C' || truck[i]!='M' || truck[i]!='D')
       return false;
     else if(ch=='C')
      if(truck[i]=='D' || truck[i]=='M' || truck[i]!='E' || truck[i]!='C')
       return false; 
     else if(ch=='E')
      if(truck[i]=='D' || truck[i]=='M' || truck[i]!='C' || truck[i]!='E')
       return false;
     else
      if(truck[i]=='E' || truck[i]=='C' || truck[i]!='D' || truck[i]!='M')
       return false;
    }
   return true;
  }
 /*public static boolean checkPrev(char[] truck,char ch,int top)
  {
   if(top==0)
    return true;
   else
    {
     if(ch=='D')
      {
       for (int i=0;i<top;i++)
        if(truck[i]!='M' && truck[i]!='D')
         return false;
       return true;
      }
     if(ch=='C')
      {
       for(int i=0;i<top;i++)
        if(truck[i]!='E' && truck[i]!='C')
         return false;
       return true;
      }
     if(ch=='E')
      {
       for(int i=0;i<top;i++)
        if(truck[i]!='C' && truck[i]!='E')
         return false;
       return true;
      }
     if(ch=='M')
      {
       for(int i=0;i<top;i++)
        if(truck[i]!='D'&&truck[i]!='M')
         return false;
        return true;
      }
    }
   return false;
  }*/
 }