#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
const int N = 2e5 + 10;
const int inf = -1e18;
ll f[N][10][20];
string tt[N];
bool st[N];
struct node
{
    string a;
    string b;
    int c;
};
bool cmp(node a , node b)
{
    return a.a < b.a;
}
void solve()
{
    int n ;
    cin >> n;
    vector<node> v2;
    map<string , int > mp;
    vector<vector<pair<int , int > > > v(2 * n + 1);
    int cnt = 1;
    for(int i = 1 ; i <= n ; i++)
    {
        string a, b;
        int c;
        cin >> a >> b >> c;
        v2.push_back({a, b , c});
        if(mp.find(a) == mp.end()) mp[a] = cnt++;
        if(mp.find(b) == mp.end()) mp[b] = cnt++;
    }
    for(int i = 0 ; i < 5 ; i++)
    {
        string a;
        cin >> a;
        if(mp.find(a) == mp.end()) mp[a] = cnt++;
        st[mp[a]] = 1;
    }
    string b;
    cin >> b;
    if(mp.find(b) == mp.end()) mp[b] = cnt++;
    int bs = mp[b];
    
    for(int j = 0 ; j < v2.size() ; j++)
    {
        int a = mp[v2[j].a];
        int b = mp[v2[j].b];
        int c = v2[j].c;
        v[a].push_back({b, c});
    }
    for(int i = 0 ; i <= cnt ; i++)
        for(int j = 0 ; j <= 5 ; j++)
            for(int k = 0 ; k <= 15 ; k++)
                f[i][j][k] = inf;
    
    f[0][0][0] = 0;
    for(int i = 1 ; i < v.size() ; i++)
    {
        for(int j = 0 ; j <= 5 ; j++)
        {
            for(int k = 0 ; k <= 15 ; k++)
            {
                f[i][j][k] = max(f[i][j][k] , f[i - 1][j][k]);
                for(auto t : v[i])
                {
                    int t2 = t.first;
                    int val = t.second;
                    int w = 0;
                    if(st[i]) w += 1;
                    if(bs == t2) w += 2;
                    if(k >= w && j >= 1)
                        f[i][j][k] = max(f[i][j][k] , val + f[i - 1][j - 1][k - w]);
                }
            }
        }
    }
    int ans = 0;
    for(int i = 0; i <= 15 ; i++)
        ans = max(ans , (int) (f[cnt - 1][5][i] * (i * 0.1 + 1)));
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while(t--)
        solve();
}