import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    public static class Pair{
        int start,end;
        char ch;
        public Pair(int start,int end,char ch){
            this.start = start;
            this.end = end;
            this.ch = ch;
        }
    }
    
    public static Comparator<Pair> comparator = new Comparator<Pair>(){
        public int compare(Pair p1,Pair p2){
            if(p1.start<p2.start)return -1;
            else if(p1.start>p2.start)return 1;
            else{
                if(p1.end<p2.end)return -1;
                else if(p1.end>p2.end)return 1;
                else return 0;
            }
        }
    };
    
    static int[] minimumZooNumbers(int m, int n, char[] t, int[] s, int[] d) {
        // Return a list of length n consisting of the answers
        // Sort according to start,end
        Pair[] pair = new Pair[n];
        for(int i=0;i<n;i++){
            pair[i] = new Pair(s[i],d[i],t[i]);
        }
        Arrays.sort(pair,comparator);
              
        // Looks like DP --- combinations --- nothing , E,D,C,M,EC,DM
       
        int[] indexE = new int[n+1];
        int[] indexD = new int[n+1];
        int[] indexC = new int[n+1];
        int[] indexM = new int[n+1];
        int[] indexEC = new int[n+1];
        int[] indexDM = new int[n+1];
        
        int[] minE = new int[n+1];
        int[] minD = new int[n+1];
        int[] minC = new int[n+1];
        int[] minM = new int[n+1];
        int[] minEC = new int[n+1];
        int[] minDM = new int[n+1];
        
        for(int i=0;i<n+1;i++){
            minE[i]=minD[i]=minC[i]=minM[i]=minEC[i]=minDM[i]=1000000;
            indexE[i]=indexD[i]=indexC[i]=indexM[i]=indexEC[i]=indexDM[i]=-1;
        }
        
        int[] minNum = new int[n+1];
        minNum[0]=0;
        
        int indE,indD,indC,indM,indEC,indDM;
        indE=indD=indC=indM=indEC=indDM=0;
        for(int i=0;i<n;i++){
            if(pair[i].ch=='E'){
                    indE++;
                    indexE[indE]=i;
                    minE[indE]=pair[i].end;
                    indEC++;
                    indexEC[indEC]=i;
                    minEC[indEC]=pair[i].end;
            }
            else if(pair[i].ch=='D'){
                    indD++;
                    indexD[indD]=i;
                    minD[indD]=pair[i].end;
                    indDM++;
                    indexDM[indDM]=i;
                    minDM[indDM]=pair[i].end;                
            }
            else if(pair[i].ch=='C'){
                    indC++;
                    indexC[indC]=i;
                    minC[indC]=pair[i].end;
                    indEC++;
                    indexEC[indEC]=i;
                    minEC[indEC]=pair[i].end;
            }
            else if(pair[i].ch=='M'){
                    indM++;
                    indexM[indM]=i;
                    minM[indM]=pair[i].end;
                    indDM++;
                    indexDM[indDM]=i;
                    minDM[indDM]=pair[i].end;                  
            }
        }
        
        for(int i=1;i<n+1;i++){
            minNum[i]=Math.min(Math.min(Math.min(minE[i],minD[i]),Math.min(minC[i],minM[i])),Math.min(minEC[i],minDM[i]));
            if(minNum[i]==1000000)minNum[i]=-1;
        }
        
        int[] ans = new int[n];
        
        for(int i=0;i<n;i++){
            ans[i] = minNum[i+1];
        }
        
        return ans;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int cases = in.nextInt();
        for(int a0 = 0; a0 < cases; a0++){
            int m = in.nextInt();
            int n = in.nextInt();
            char[] t = new char[n];
            for(int t_i = 0; t_i < n; t_i++){
                t[t_i] = in.next().charAt(0);
            }
            int[] s = new int[n];
            for(int s_i = 0; s_i < n; s_i++){
                s[s_i] = in.nextInt();
            }
            int[] d = new int[n];
            for(int d_i = 0; d_i < n; d_i++){
                d[d_i] = in.nextInt();
            }
            int[] result = minimumZooNumbers(m, n, t, s, d);
            for (int i = 0; i < result.length; i++) {
                System.out.print(result[i] + (i != result.length - 1 ? " " : ""));
            }
            System.out.println("");


        }
        in.close();
    }
}