#include <bits/stdc++.h>

#define el '\n'

typedef long long ll;
typedef long double ld;

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

void testCase() {
    ll k;
    int n;
    cin >> n >> k;

    int a;
    string s;
    map<string, int> mp;
    for (int i = 0; i < n; i++)
        cin >> s >> a, mp[s] = a;

    int l;
    cin >> l;

    map<string, int> mx, freq, mxFreq;
    for (int i = 0; i < l; i++) {
        cin >> s >> a;

        if (a != mx[s])
            mx[s] = a, mxFreq[s] = 1;
        else if (a == mx[s])
            mxFreq[s]++;

        freq[s]++;
    }

    ll sol = 0;
    for (auto &i: mx) {
        if (mp[i.first] <= i.second) {
            k -= i.second - mp[i.first];

            sol += 1LL * i.second * (freq[i.first] - mxFreq[i.first]);
        }
        else
            sol += 1LL * mp[i.first] * freq[i.first];
    }

    if (k < 0)
        return cout << 0, void();

    set<string> vis;
    set<pair<ll, string>, greater<>> st;
    for (auto &i: mx) {
        if (mp[i.first] <= i.second)
            st.emplace(1LL * (i.second + 1) * mxFreq[i.first] + freq[i.first] - mxFreq[i.first], i.first);
        else
            st.emplace(freq[i.first], i.first);
    }

    while (vis.find(st.begin()->second) == vis.end() && k) {
        k--;

        auto p = *st.begin();

        sol += p.first;

        vis.insert(p.second);

        st.erase(st.begin());

        st.emplace(freq[p.second], p.second);
    }

    sol += 1LL * k * st.begin()->first;

    cout << sol;
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();
}