#![allow(unused_imports, dead_code, unused_macros, unused_variables, non_snake_case, unused_parens)]
use proconio::{input,marker::{Bytes, Chars, Usize1,Isize1}};
use std::ops::*;
use std::cmp::*;
use std::mem::swap;
use std::collections::*;

const MOD:u64 = 1_000_000_007;
const INF:i64 = 0x3fff_ffff_ffff_ffff;
const YES:&str="Yes";const NO:&str="No";macro_rules!yesno{($var:expr) => {if $var{println!("{}",YES);}else{println!("{}",NO);}}}

macro_rules! min {($a:expr $(,)*) => {{$a}};($a:expr, $b:expr $(,)*) => {{std::cmp::min($a, $b)}};($a:expr, $($rest:expr),+ $(,)*) => {{std::cmp::min($a, min!($($rest),+))}};}
macro_rules! max {($a:expr $(,)*) => {{$a}};($a:expr, $b:expr $(,)*) => {{std::cmp::max($a, $b)}};($a:expr, $($rest:expr),+ $(,)*) => {{std::cmp::max($a, max!($($rest),+))}};}
macro_rules! chmin {($base:expr, $($cmps:expr),+ $(,)*) => {{let cmp_min = min!($($cmps),+);if $base > cmp_min {$base = cmp_min;true} else {false}}};}
macro_rules! chmax {($base:expr, $($cmps:expr),+ $(,)*) => {{let cmp_max = max!($($cmps),+);if $base < cmp_max {$base = cmp_max;true} else {false}}};}
macro_rules! mulvec {($x:expr; $s:expr) => {vec![$x; $s]};($x:expr; $s0:expr; $( $s:expr );+) => {mulvec![vec![$x; $s0]; $( $s );+ ]};}
macro_rules! outputln {($var:expr)=>{println!("{}",$var)};($var:expr,$($vars:expr),+)=>{print!("{} ",$var);outputln!($($vars),+);};}
macro_rules! debug {($($a:expr),* $(,)*) => {eprintln!(concat!($("| ",stringify!($a), "={:?} "),*, "|"),$(&$a),*);};}


fn solve() {
    input! {
        T: usize,
    }
	for _ in 0..T {
		input!{
			mut R: Chars,
			S: Chars,
			K: usize,
		}
		let topK_W = R.iter().take(K).filter(|r| **r == 'W').count();
		let topK_A = R.iter().take(K).filter(|r| **r == 'A').count();
		let topK_Q = R.iter().take(K).filter(|r| **r == '?').count();
		let last_W = R.iter().skip(K).filter(|r| **r == 'W').count();
		let last_A = R.iter().skip(K).filter(|r| **r == 'A').count();
		let last_Q = R.iter().skip(K).filter(|r| **r == '?').count();
		let include_W = (topK_W + last_W) > 0;
		if S[0] == 'N' {
			// 先頭Kが全てAではない or Wが１文字も含まれない
			let topK_is_A = (0..K).all(|i| R[i] != 'W');
			if include_W {
				// 先頭KはAのみではない
				if topK_W == 0 && topK_Q == 1 {
					for i in 0..K {
						if R[i] == '?' {
							R[i] = 'W';
						}
					}
				}
			}
			if topK_A == K {
				// すべてA確定
				for i in K..R.len() {
					R[i] = 'A';
				}
			}

		}else{
			// 先頭Kは'A'
			for i in 0..K {
				R[i] = 'A';
			}
			// Wが含まれる
			if !include_W {
				let mut cnt = 0;
				let mut idx = 0;
				for i in K..R.len() {
					if R[i] == '?' {
						cnt += 1;
						idx = i;
					}
				}
				if cnt == 1 {
					R[idx] = 'W';
				}
			}
		}
		outputln!(R.iter().collect::<String>());
	}
}

fn main() {
    std::thread::Builder::new()
        .stack_size(128 * 1024 * 1024)
        .spawn(|| solve()).unwrap()
        .join().unwrap();
}