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


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

void solve(){
         int n; cin>>n;
         bool goodName[n], goodColor[n];
         ::memset(dp, 0, sizeof dp);
         ::memset(goodColor, 0, sizeof goodColor);
         ::memset(goodName, 0, sizeof goodName);

         string name[n], color[n];
         int power[n];
         for(int i = 0; i < n; i++){
                  cin>>name[i]>>color[i]>>power[i];
         }

         for(int i = 0; i < 5; i++){
                  string s; cin>>s;
                  for(int j = 0; j < n; j++){
                           if(name[j] == s)
                                    goodName[j]= 1;
                  }
         }
         string cc; cin>>cc;
         for(int i = 0; i < n; i++){
                  if(color[i] == cc){
                           goodColor[i]= 1;
                  }
         }
         for(int ca = 0; ca <= 5; ca++){
                  for(int na = 0; na <= 5; na++){
                           for(int pick = 0; pick <= 5; pick++){
                                    dp[pick][na][ca][n & 1]= INT_MIN;
                           }
                  }
         }
         dp[0][0][0][n & 1] = 0;
         for(int i = n - 1; i >= 0; i--){
                  int p = i & 1;
                  int q = p ^ 1;
                  for(int pick = 0; pick <= 5; pick++){
                           for(int na = 0; na <= 5; na++){
                                    for(int ca = 0; ca <= 5; ca++){
                                             dp[pick][na][ca][p] = dp[pick][na][ca][q];
                                             if(pick && na - goodName[i] >= 0 && ca - goodColor[i] >= 0){
                                                      dp[pick][na][ca][p]= max(dp[pick][na][ca][p],
                                                                               power[i] + dp[pick - 1][na - goodName[i]][ca - goodColor[i]][q]);
                                             }
                                    }
                           }
                  }
         }

         int ans = 0;
         for(int na = 0; na <= 5; na++){
                  for(int ca = 0; ca <= 5; ca++){
                           int base = dp[5][na][ca][0];
                           double x = base;
                           for(int i = 0; i < na; i++){
                                    x += base * 0.1;
                           }
                           for(int i = 0; i < ca; i++){
                                    x += base * 0.2;
                           }
                           ans= max(ans, (int)floor(x));
                  }
         }
         cout<<ans<<"\n";
}
int32_t main() {
         cin.tie(0);
         cout.sync_with_stdio(0);

         int T; cin>>T;
         while(T--) solve();
}