#include <bits/stdc++.h>
// #define tests
#define int long long
const int N = 1e5 + 10;
using namespace std;
using LL = long long;

void solve() {
    int n, k;
    cin >> n >> k;
    map<string, int> mp1, mp2, mp3;
    for(int i = 1; i <= n; i++) {
        string s;
        int x;
        cin >> s >> x;
        mp1[s] = x;
    } 
    int m;
    cin >> m;
    map<string, vector<int>> v;
    for(int i = 1; i <= m; i++){
        string s;
        int x;
        cin >> s >> x;
        v[s].push_back(x);
        mp2[s] = max(mp2[s], x); //xiaohao
    }

    int sum1 = 0, sum2 = 0;
    for(auto [x, y] : mp2) {
        sum1 += mp1[x];
        sum2 += y;
    }

    if(sum2 >= sum1 + k){
        cout << 0;
        return;
    }

    for(auto &[x, y] : mp1){
        if(y <= mp2[x]) {
            k -= mp2[x] - y;
            y = mp2[x];
        }
    }

    int maxv = 0;
    map<string, int> d;
    for(auto [s, vv] : v){
        maxv = max(maxv, (int)vv.size());
        for(auto x : vv){
            if(mp1[s] > x) d[s] ++;
            else d[s] += mp1[s] + 1;
        }
    }
    
    priority_queue<pair<int,string>> q;
    for(auto [s, x] : d) q.push({x, s});
    
    while(q.size() && k && q.top().first >= maxv){
        auto [x, y] = q.top();
        mp1[y] ++;
        q.pop();
        k --;   
    }

    for(auto [s, vv] : v){
        if(vv.size() == maxv) mp1[s] += k;
    }
    
    int ans = 0;
    for(auto [s, vv] : v){
        for(auto x : vv){
            if(mp1[s] > x) ans += mp1[s];
        }
    }
    cout << ans << '\n';
}

signed main() {
    cin.tie(0)->ios::sync_with_stdio(0);
    cout.tie(0);

    int t = 1;
#ifdef tests
    cin >> t;
#endif
    for(int _ = 1; _ <= t; _ ++) solve();
}