#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

struct Info {
    string name, color;
    int power;
} info[100005];

void solve() {
    vector<int> pw[6][2];
    map<string, pii> other;
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> info[i].name >> info[i].color >> info[i].power;
    }
    vector<string> bname;
    string bcolor;
    for (int i = 0; i < 5; ++i) {
        string s;
        cin >> s;
        bname.pb(s);
    }
    cin >> bcolor;
    for (int i = 1; i <= n; ++i) {
        int idx = find(ALL(bname), info[i].name) - bname.begin(); 
        int mch = int(info[i].color == bcolor);
        if (idx == 5) {
            auto p = other.find(info[i].name);
            pii res;
            if (p != other.end()) res = p->Y;
            else res = pii(0, 0);
            if (mch) res.Y = max(res.Y, info[i].power);
            else res.X = max(res.X, info[i].power);
            other[info[i].name] = res;
        }
        else pw[idx][mch].pb(info[i].power);
    }
    for (int i = 0; i < 5; ++i)
        for (int j = 0; j < 2; ++j)
            sort(ALL(pw[i][j]), greater<>());
    int dp[6][6] = {};
    for (auto &[s, v] : other) {
        for (int i = 5; i >= 1; --i)
            for (int j = 0; j <= 5; ++j) {
                if (v.X && dp[i - 1][j]) {
                    dp[i][j] = max(dp[i][j], dp[i - 1][j] + v.X);
                }
                if (v.Y && j && dp[i - 1][j - 1]) {
                    dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + v.Y);
                }
            }
        if (v.X) dp[1][0] = max(dp[1][0], v.X);
        if (v.Y) dp[1][1] = max(dp[1][1], v.Y);
    }

    auto cal = [&](int i, int j) {
        int pt = 0, sum = 0, bonus = 100, rmd = 5, cnt = __builtin_popcount(j);
        for (int k = 0; k < 5; ++k)
            if (i >> k & 1) {
                int mch = (j >> pt) & 1;
                if (SZ(pw[k][mch]) <= 0) return pii(0, 0);
                sum += pw[k][mch][0];
                bonus += 10 + 20 * mch;
                ++pt, cnt -= mch, --rmd; 
            }
        //cerr << i << " " << j << " " << rmd << " " << cnt << "!!\n";
        if (rmd + cnt && !dp[rmd][cnt]) return pii(0, 0);
        bonus += 20 * cnt;
        sum += dp[rmd][cnt];
        //cerr << i << " " << j << " " << rmd << " " << cnt << " " << sum << " " << bonus << " " << sum * bonus / 100 << "\n";
        return pii(sum, bonus);
    };

    int ans = 0;
    for (int i = 0; i < (1 << 5); ++i)
        for (int j = 0; j < (1 << 5); ++j) {
            auto [sum, bonus] = cal(i, j);
            ans = max(ans, sum * bonus / 100);
        }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}