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

using ll = long long;
#define int ll
using pii = pair<int, int>;

void solve() {
    int n;
    cin>>n;
    string s;
    cin>>s;
    vector<int> us(2*n);
    int indw = 0, p = 0;
    int res = 0;
    int ind = n - 1;
    while(ind >= 0 && s[ind] != 'W')
    {
        ind--;
    }
    int fl = 0, k = n;
    while(indw < ind && s[indw] == 'W')
    {
        us[ind] = 1;
        us[indw] = 1;
        fl++;
        res += 2;
        ind--;
        k--;
        indw++;
        while(ind >= 0 && s[ind] != 'W')
        {
            ind--;
        }
    }
    for(int i = 0; i < n; i++)
    {
        if(us[i] == 0)
        {
            k--;
        }
    }
    int P = 0, T = 1;
    for(int i = n; i < 2 * n; i++)
    {
        if(s[i] == 'W')
        {
            fl++;
            res++;
        }
        else 
            k--;
        // cout<<"RES "<<res<<" "<<k<<endl;
        if(res == n) break;
        if(k < 0)
        {
            T = 0;
            k = 1e9;
        }
    }
    if(T == 1)
        cout<<"YES"<<'\n';
    else cout<<"NO"<<'\n';
}

int32_t main() {
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);

    int tt = 1;
    cin >> tt;
    for (int t = 0; t < tt; t++) {
        solve();
    }
    return 0;
}