#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n, k;
    cin >> n >> k;
    ll tot = 0;
    map<string, ll> m;
    vector<ll> cur(n + 1);
    for (ll i = 1; i <= n; ++i) {
        string s;
        cin >> s;
        ll p;
        cin >> p;
        if (!m[s])
            m[s] = ++tot;
        cur[m[s]] = p;
    }    
    ll mm;
    cin >> mm;
    ll ans = 0;
    priority_queue<pair<ll, ll>> q;
    vector<pair<ll, ll>> a(n + 1, {-1, 0});
    vector<map<ll, ll>> kkk(n + 1);
    for (ll i = 1; i <= mm; ++i) {
        string s;
        cin >> s;
        ll p;
        cin >> p;
        ll id = m[s];
        if (a[id].first == -1)
            a[id].first = p, a[id].second = 1;
        else {
            if (a[id].first <= p)
                a[id] = {p, a[id].second + 1};
            else 
                ++a[id].second;
        }
        ++kkk[id][p];
    }
    ll ss = 0;
    for (ll i = 1; i <= n; ++i) {
        ss += max(0ll, a[i].first - cur[i]);
        ans += 1ll * a[i].first * (a[i].second - kkk[i][a[i].first]);
        q.push({a[i].first * kkk[i][a[i].first] + a[i].second, a[i].second});
    }
    if (k < ss) {
        cout << "0\n";
        return 0;
    }
    k -= ss;
    // cout << k << ' ' << ans << endl;
    while (k > 0 && !q.empty()) {
        auto [v, cnt] = q.top();
        q.pop();
        if (v == cnt) {
            ans += 1ll * v * k;
            break;
        }
        ans += v, q.push({cnt, cnt});
        --k;
    }
    cout << ans << '\n';
    return 0;
}