#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <climits>
using namespace std;

using ll = long long;
const int MOD = 1e9 + 7;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while(t--) {
        int n, a, b;
        string str;
        cin >> n >> a >> b >> str;
        int cnt[3] = {0, 0, 0};
        for(int i = 0; i < n; i++) {
            if(str[i] == 'V') {
                cnt[2]++;
            } else if(str[i] == 'C') {
                cnt[0]++;
            } else {
                cnt[1]++;
            }
        }
        int c = min(cnt[2], min(a, b));
        
        cnt[2] -= c;
        a -= c;
        b -= c;

        int ans1 = c;
        ans1 += a/2;
        ans1 += b/2;

        int ans2 = 0;
        if(c-1 >= 0) {
            ans2 = c-1;
            ans2 += (a+1)/2;
            ans2 += (b+1)/2;
        }
        cout << max(ans1, ans2) << "\n";
    }
    return 0;
}