#include<bits/stdc++.h>

using ll = long long;
using ull = unsigned long long;
using i64 = long long;

using namespace std;


void solve()
{
    int n;
    cin >> n;
    vector<int>a(n + 1), b(n + 1),idx(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        idx[a[i]] = i;
    }
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
    }
    vector<int>vs(n + 1);
    auto dfs = [&](auto &&self,int p)->int
        {
            if (vs[p])
                return false;
            else {
                vs[p] = true;
                return self(self, idx[b[p]]) + 1;
            }
        };

    int ans = 0;
    for (int i = 1; i <= n; i++) {
        ans += dfs(dfs, i) > 1;
    }
    ans &= 1;
    string res;
    res += ans ? 'A' : 'B';
    int t = n - 1;
    while (t--) {
        char c;
        int l, r, k;
        cin >> c >> l >> r >> k;
        ans ^= ((r - l) * k) & 1;
        res += ans ? 'A' : 'B';
    }
    cout << res << endl;
    return;

}

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

    int tt;
    cin >> tt;
    while (tt--)
        solve();
    return 0;
}