#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;

void solve(){
  string r, s; int k; cin >> r >> s >> k;
  int n=r.size();
  if(s[0]=='N'){
    cout << r << '\n'; return;
  }
  int nw=0, nq=0;
  for(int i=k; i<n; i++){
    if(r[i]=='?') nq++;
    if(r[i]=='W') nw++;
  }
  for(int i=0; i<n; i++){
    if(r[i]!='?'){
      cout << r[i]; continue;
    }
    if(i<k){
      cout << 'A'; continue;
    }
    cout << (nw==0&&nq==1?'A':'?');
  }
  cout << '\n';
}

int main(void){
  int t; cin >> t;
  while(t--){
    solve();
  }
  return 0; 
}