#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
//#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, LOG = 31, inf = 1e9, mod = 998244353;
const ll INF = 1e18;

int n;
mt19937 rnd(228);
ll k;
ll s;
const int maxN = 1e5 + 10;
string S[maxN];
ll sc[maxN];
map<string, int> mp;
vector<ll> g[maxN];
void solve() {
    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        cin >> S[i] >> sc[i];
        mp[S[i]] = i;
//        cout << " ???? " << sc[i] << endl;
    }
    int l;
    cin >> l;
    for (int i = 0; i < l; i++) {
        string x;
        ll st;
        cin >> x >> st;
        assert(mp.count(x));
        int p = mp[x];
        g[p].emplace_back(st);
    }
    vector<pair<ll,ll>> T;
    ll INI = 0;
    for (int i = 0; i < n; i++) {
        if (g[i].empty()) continue;
        sort(g[i].begin(), g[i].end());
        ll MX = g[i].back();

        if (sc[i] < MX) {
            k -= (MX - sc[i]);
            sc[i] = MX;
        }

        //+cnt, +cnt
        if (sc[i] == MX) {
            ll cnt = 0;
            ll add = 0;
            ll S = 0;
            for (ll u : g[i]) {
                if (u < MX) {
                    S += MX;
                    cnt++;
                }
                else {
                    assert(u == MX);
                }
            }
            INI += S;
//            cout << " ADDD " << S << endl;
            add = (MX + 1) * g[i].size() - INI;
            //g[i].size()
            T.emplace_back((ll)g[i].size(), add);
        }
        else {
            assert(sc[i] > MX);
            INI += sc[i] * g[i].size();
//            cout << " ADDD " << sc[i] << " " << g[i].size() << endl;
            T.emplace_back((ll)g[i].size(), (ll)g[i].size());
        }
    }
    if (k < 0) {
        cout << 0 << '\n';
        return ;
    }
    if (k == 0) {
        cout << INI << '\n';
        return;
    }
    ll best = -1e18;
    sort(T.begin(), T.end());
    priority_queue<ll, vector<ll>, greater<>> pq;
    ll CUR_S = 0;
//    cout << INI << " ??? " << endl;
    for (int i = 0; i < T.size(); i++) {
        while (!pq.empty() && pq.size() > k - 1) {
            CUR_S -= pq.top();
            pq.pop();
        }
        while (!pq.empty() && pq.top() < T[i].first) {
            CUR_S -= pq.top();
            pq.pop();
        }
        CUR_S += T[i].second;
        best = max(best, INI + CUR_S + (k - (ll)pq.size() - 1) * T[i].first);
        pq.push(T[i].second);
    }
    cout << best << '\n';
}

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}