#include<bits/stdc++.h>

#define N 200010

using namespace std;

int a,b,c,d,n;
char s[N];

void solve()
{
	cin>>a>>b>>c>>d;
	scanf("%s",s+1);
	n=a+b+2*c+2*d;
	int na=0,nb=0;
	for(int i=1;i<=n;i++) (s[i]=='A'?na:nb)++;
	if(na!=a+c+d||nb!=b+c+d){puts("NO");return;}
	int tot=0,l=1;
	vector<int> A,B;
	for(int i=1;i<=n;i++)
	{
		if(i==n||s[i]==s[i+1])
		{
			if((i-l+1)&1) tot+=(i-l+1)/2;
			else
			{
				int x=(i-l+1)/2;
				if(s[l]=='A') A.push_back(x);
				else B.push_back(x);
			}
			l=i+1;
		}
	}
	sort(A.begin(),A.end());
	sort(B.begin(),B.end());
	for(int x:A)
	{
		if(c>=x) c-=x;
		else tot+=x-1;
	}
	for(int x:B)
	{
		if(d>=x) d-=x;
		else tot+=x-1;
	}
	puts(c+d<=tot?"YES":"NO");
}

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