#include <iostream>

 #include <map>

 #include <vector>

 #include <cstring>

 #include <queue>

 #include <algorithm>

 using namespace std;

 typedef pair<int, int> pii;

 int buf[], need[][];

 int main()

 {

     int T, n, m;

     cin >> T;

     map<string, int> mp;

     mp["CV"] = ; mp["DD"] = ; mp["CL"] = ;

     mp["CA"] = ; mp["BB"] = ; mp["BC"] = ;

     while (T--)

     {

         memset(need, , sizeof need);

         cin >> n >> m;

         string s;

         int l, f;

         vector<pii> v[];

         for (int i = ; i < n; i++)

         {

             cin >> s >> l >> f;

             v[mp[s]].push_back(pii(l, f));

         }

         for (int i = ; i < ; i++) sort(v[i].begin(), v[i].end());

         for (int i = ; i < m; i++)

         {

             for (int j = ; j < ; j++) cin >> buf[j];

             cin >> l;

             for (int j = ; j < ; j++)

             {

                 need[j][l] += buf[j];

             }

         }

         bool flg = true;

         int ans = ;

         for (int i = ; i < ; i++)

         {

             priority_queue<int, vector<int>, greater<int>> q;

             for (int j = ; j >= ; j--)

             {

                 if (need[i][j])

                 {

                     while (!v[i].empty() && v[i].back().first >= j)

                     {

                         q.push(v[i].back().second);

                         v[i].pop_back();

                     }

                     if (q.size() < need[i][j]) { flg = false; break; }

                     while (need[i][j]) { ans += q.top(); q.pop(); need[i][j]--; }

                 }

             }

             if (!flg) break;

         }

         if (!flg) cout << - << endl;

         else cout << ans << endl;

     }

     return ;

 }