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

#define int long long
const int INF = 1e18;

int dp[2][6][16];

void solve() {
	int n; cin >> n;
	map<string, vector<pair<string, int>>> cd;
	for (int i = 0; i < n; i++) {
		string x, y; int z; cin >> x >> y >> z;
		cd[x].emplace_back(y, z);
	}

	vector<string> bn(5);
	for (int i = 0; i < 5; i++) {
		cin >> bn[i];
	}
	string bncol; cin >> bncol;

	for (int i = 0; i <= 5; i++) {
		for (int j = 0; j <= 15; j++) {
			dp[0][i][j] = dp[1][i][j] = -INF;
		}
	}
	dp[0][0][0] = dp[1][0][0] = 0;

	for (auto [name, cards]: cd) {
		for (int i = 0; i <= 5; i++) {
			for (int j = 0; j <= 15; j++) {
				dp[0][i][j] = dp[1][i][j];
			}
		}

		int bonusBase = 0;
		if (find(bn.begin(), bn.end(), name) != bn.end()) bonusBase = 1;
		for (auto [col, pw]: cards) {
			int bonus = bonusBase;
			if (col == bncol) bonus += 2;

			for (int i = 0; i+1 <= 5; i++) {
				for (int j = 0; j+bonus <= 15; j++) {
					dp[1][i+1][j+bonus] = max(dp[1][i+1][j+bonus], dp[0][i][j] + pw);
				}
			}
		}
	}

	int ans = 0;
	for (int i = 0; i <= 5; i++) {
		for (int j = 0; j <= 15; j++) {
			if (dp[1][i][j] <= 0) continue;
			int sc = dp[1][i][j];
			int bs = sc*(j/10.0);

			ans = max(ans, sc+bs);
		}
	}
	cout << ans << '\n';
}

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

	return 0;
}