1 #include<cstdio>
 2 #include<cstdlib>
 3 #include<cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 using namespace std;
 7
 8 struct Node
 9 {
10     int c;
11     Node *left;
12     Node *right;
13 };
14
15 int fm[1010];
16 int t, n, m;
17 char dis[1010];
18 int pree[1010],ine[1010];
19
20 Node* BuildTree(int *pre, int *in, int length)      //建树
21 {
22     if(length == 0) return NULL;
23     Node* node = (Node*) malloc(sizeof(Node));
24     node->c = pre[0];
25     int rootindex = -1;
26     for(int i = 0;i < length;i++)
27     {
28         if(in[i] == pre[0])
29         {
30             rootindex = i;
31             break;
32         }
33     }
34     node->left = BuildTree(pre+1,in,rootindex);//left
35     node->right = BuildTree(pre+1+rootindex,in+rootindex+1,length-rootindex-1);//right
36     return node;
37 }
38
39 void print(Node *root)          //记录父节点
40 {
41     if(root != NULL)
42     {
43         if(root->left != NULL) fm[root->left->c] = (root->c)*10;
44         print(root->left);
45         if(root->right != NULL) fm[root->right->c] = (root->c)*10+1;
46         print(root->right);
47     }
48 }
49
50 void dfs(Node* root)            //释放内存
51 {
52     if(root != NULL)
53     {
54         if(root->left != NULL) dfs(root->left);
55         if(root->right != NULL) dfs(root->right);
56         free(root);
57     }
58 }
59
60 int main()
61 {
62     //freopen("test.in", "r", stdin);
63     scanf("%d", &t);
64     while(t--)
65     {
66         scanf("%d", &n);
67         for(int i = 0; i < n; i++)
68         {
69             scanf("%d", &pree[i]);
70             ine[i] = i+1;
71         }
72         Node *root = BuildTree(pree, ine, n) ;
73         fm[root->c] = 0;                //就是这里，坑死我了……我@#￥%^&*!
74         print(root);
75         scanf("%d",&m);
76         for(int i = 0; i < m; i++)
77         {
78             int mid;
79             scanf("%d", &mid);
80             int k = 0;
81             while(fm[mid] != 0)
82             {
83                 if(fm[mid]%10 == 1) dis[k] = 'W';
84                 else dis[k] = 'E';
85                 mid = fm[mid]/10;
86                 k++;
87             }
88             for(int j = k-1; j >=0; j--) printf("%c", dis[j]);      //输出路径
89             printf("\n");
90         }
91         dfs(root);
92     }
93     return 0;
94 }