# haru: pypy
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

"""
問題文がよめなすぎる
"""

def check(c, s, k):
    no = 0
    for i in range(k):
        if c[i] != "A":
            no = 1
    if c.count("W") == 0:
        no = 1
    return (s[0] == "N") ^ no ^ 1

from itertools import product
def naive(r, s, k):
    ok = []
    for c in product("AW", repeat=len(r)):
        for i in range(len(r)):
            if r[i] != "?" and r[i] != c[i]:
                break
        else:
            if check(c, s, k):
                ok.append(c)
    
    if len(ok) == 0:
        return None
    p = []
    for i in range(len(r)):
        s = set()
        for c in ok:
            s.add(c[i])
        if len(s) == 1:
            p.append(s.pop())
        else:
            p.append("?")
    return "".join(p)

def solve(r, s, k):

    if s[0] == "W":
        # one 以上 W
        # 矛盾はしない
        for i in range(k):
            r[i] = "A"
        
        ca = [] 
        for i in range(k, len(r)):
            if r[i] != "A":
                ca.append(i)
        # print(ca)
        if len(ca) == 1:
            r[ca[0]] = "W"
    else:
        # all a or k not a
        ok = 1
        for i in range(len(r)):
            if r[i] == "W":
                ok = 0
        
        if ok == 0:
            ca = [] 
            for i in range(k):
                if r[i] != "A":
                    ca.append(i)
            if len(ca) == 1:
                r[ca[0]] = "W"
        else:
            ca = []
            for i in range(k):
                if r[i] != "A":
                    ca.append(i)
            if len(ca) == 0:
                for i in range(len(r)):
                    r[i] = "A"
    
    # print("".join(r))
    return "".join(r)


# for r in product("AW?", repeat = 4):
#     for s in ("N", "W"):
#         q = naive(list(r), s, 2)
#         if q == None:
#             continue
#         p = solve(list(r), s, 2)
#         if p != q:
#             print(r, s, 2, p, q)
#             assert False


t = int(input())
for i in range(t):
    r = list(SI())
    s = SI()
    k = II()
    a = solve(r, s, k)
    print(a)