#include<cstdio>

#include<algorithm>

#include<cstring>

using namespace std;

const int maxn=;

struct node  {

    int data;

    node * left;

    node * right;

};

int pre[maxn],in[maxn],T,N,q,x;

void init () {

    fill (pre,pre+maxn,);

    fill (in,in+maxn,);

}

node * create (int preL,int preR,int inL,int inR) {

    if (preL>preR) return NULL;

    node * root=new node;

    root->data=pre[preL];

    int k;

    for (k=inL;k<=inR;k++) {

        if (in[k]==pre[preL]) break;

    }

    int numLeft=k-inL;

    root->left=create(preL+,preL+numLeft,inL,k-);

    root->right=create(preL+numLeft+,preR,k+,inR);

    return root;

}

void dfs (node * root,int v) {

    if (root->data==v) {

        printf ("\n");

        return;

    }

    if (v<root->data) printf ("E"),dfs (root->left,v);

    else printf ("W"),dfs (root->right,v);

}

int main () {

    scanf ("%d",&T);

    while (T--) {

        scanf ("%d",&N);

        for (int i=;i<=N;i++) in[i]=i;

        for (int i=;i<=N;i++) scanf ("%d",&pre[i]);

        node * root=create(,N,,N);

        scanf ("%d",&q);

        for (int i=;i<q;i++) scanf ("%d",&x),dfs (root,x);

    }

    return ;

}