#include "bits/stdc++.h"

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

#define endl            "\n"
#define all(v)          v.begin(), v.end()
#define debug(x)        cout << #x << " is " << x << endl
#define clr(x, value)    memset(x, value, sizeof(x))
#define Unique(x)       x.erase(unique(all(x)), x.end())

using namespace std;
using ll = long long;

const int N = 1e5 + 5;
ll dp[N][6][6][6], n, id;
int vis[N][6][6][6];
map<string, pair<int, int>> mp;
vector<string> goodNames;
string goodColor;
vector<string> names;

ll go(int i, int took, int wantName, int wantColor) {
    if (min(wantColor, wantName) < 0) return -1e15;
    if (took == 5) return (wantColor + wantName ? -1e15 : 0);
    if (i == mp.size()) return -1e15;

    ll &ret = dp[i][took][wantName][wantColor];
    if (vis[i][took][wantName][wantColor] == id) return ret;

    vis[i][took][wantName][wantColor] = id;

    ret = go(i + 1, took, wantName, wantColor);
    bool goodName = binary_search(goodNames.begin(), goodNames.end(), names[i]);
    auto p = mp[names[i]];
    bool isGoodColor = p.first;
    if (p.first)
        ret = max(ret, p.first + go(i + 1, took + 1,
                                    wantName - goodName, wantColor - isGoodColor));

    if (p.second)
        ret = max(ret, p.second + go(i + 1, took + 1,
                                    wantName - goodName, wantColor));
    return ret;
}

struct card {
    string name, color;
    int power;

    card(string name, string color, int power) :
            name(name), color(color), power(power) {

    }
};

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);

    int TC;
    cin >> TC;
    while (TC--) {
        cin >> n;
        id++;

        mp.clear();
        names.clear();

        vector<card> cards;

        for (int i = 0; i < n; ++i) {
            string name, color;
            int power;
            cin >> name >> color >> power;
            cards.emplace_back(name, color, power);
            names.push_back(name);
        }

        sort(all(names));
        Unique(names);

        goodNames.resize(5);
        for (int i = 0; i < 5; ++i) {
            cin >> goodNames[i];
        }
        sort(all(goodNames));

        cin >> goodColor;

        for (int i = 0; i < n; ++i) {
            auto [name, color, power] = cards[i];
            if (color == goodColor) mp[name].first = max(mp[name].first, power);
            else mp[name].second = max(mp[name].second, power);
        }

        ll mx = 0;
        for (int i = 0; i <= 5; ++i) {
            for (int j = 0; j <= 5; ++j) {
                ll cur = i * 10 + j * 20;
                ll ans = (1 + cur / 100.0) * go(0, 0, i, j);
                mx = max(mx, ans);
            }
        }
        cout << mx << endl;
    }
    return 0;
}