#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long
#define ld  long double

using LL = long long; using ULL = unsigned long long;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
using VL = vector<LL>; using VVL = vector<VL>; using VVVL = vector<VVL>;
using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>;
using VD = vector<double>; using VVD = vector<VD>; using VVVD = vector<VVD>;
using VC = vector<char>; using VS = vector<string>; using VVC = vector<VC>;
using PII = pair<int,int>; using PLL = pair<LL,LL>; using PDD = pair<double,double>; using PIL = pair<int,LL>;
using MII = map<int,int>; using MLL = map<LL,LL>;
using SI = set<int>; using SL = set<LL>;
using MSI = multiset<int>; using MSL = multiset<LL>;
template<class T> using MAXPQ = priority_queue<T>;
template<class T> using MINPQ = priority_queue< T, vector<T>, greater<T> >;

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
#define PI  3.14159265358979323846

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(e, v) for(auto &e : v)
#define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it)
#define ALL(v) v.begin(),v.end()

vector<ll> x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1};
int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1};

/*
memo
-uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy
-isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv
nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10
-dijkstra,Floyd,bellmanford,sccd,topological,treediamiter
-compress1,compress2,rotate90

-co,ci,fo1,fo2,fo3,fo4
-bitsearch,binaryserach
-bfs
-SegTreedec,SegTreeLazydec
*/
/*
Warong:
    :K すべてAにする
    それ以降 Aが全部、?1個 W確定　それ以外 ? のまま

NotWarong
    :K Wがあるならそのまま。すべてAならそれ以降について考える。
    then それ以降 すべてAにしてないとだめ

    :K ?が1個、残りA
    then それ以降 ?があるならそのまま,Wが存在では?はA
*/
void solve(){
    string r,s; cin >> r >> s;
    ll K; cin >> K;
    string X = "";
    ll N = r.size();
    if(s == "Warong"){
        for(ll i = 0; i < K; i++) r[i] = 'A';
        ll allA = 1;
        ll qc = 0;
        for(ll i = K; i < N; i++){
            if(r[i]=='?') qc++;
            if(r[i]=='W') allA = 0;
        }

        if(allA and qc == 1){
            for(ll i = K; i < N; i++){
                if(r[i]=='?') r[i] = 'W';
            }
        }
    }
    else{
        ll allA = 1;
        ll qc = 0;
        for(ll i = 0; i < K; i++){
            if(r[i]=='?') qc++;
            if(r[i]=='W') allA = 0;    
        }

        if(allA){
            if(qc == 1){
                ll kqc = 0;
                ll wc = 0;
                for(ll i = K; i < N; i++){
                    if(r[i]=='W') wc++;
                    if(r[i]=='?') kqc++;
                }

                if(wc){
                    for(ll i = 0; i < K; i++) if(r[i]=='?') r[i] = 'W';
                }
            }
            else if(qc == 0){
                for(ll i = 0; i < N; i++) r[i] = 'A';
            }
        }
    }

    cout << r << '\n';
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int t; cin >> t;
    while(t--){
        solve();
    }
    
    
}