#include <bits/stdc++.h>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef double db;
typedef long double ldb;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define LI(i, a, b) for (int i = a; i <= b; i++)  // forloop inclusive
#define LE(i, a, b) for (int i = a; i < b; i++)   // forloop exclusive
#define LBI(i, a, b) for (int i = a; i >= b; i--) // forloop backward inclusive
#define LBE(i, a, b) for (int i = a; i > b; i--)  // forloop backward inclusive

#define all(x) begin(x), end(x)
#define Min(a, b) ((a) < (b) ? (a) : (b))
#define Max(a, b) ((a) < (b) ? (b) : (a))

void b()
{
    ll n, k;
    cin >> n >> k;
    unordered_map<string, ll> attr;
    unordered_map<string, vector<ll> > challs;
    vector<string> prevs;
    string name;
    ll score, res = 0;
    LE(i, 0, n)
    {
        cin >> name >> score;
        attr.insert(pair<string, ll >(name, score));
    }

    cin >> n;
    LE(i, 0, n)
    {
        cin >> name >> score;
        challs[name].push_back(score);
    }

    for(auto &a : challs) {
        sort(all(a.second));
        k -= (a.second.back() - attr[a.first] > 0) ? a.second.back() - attr[a.first] : 0;
        if (k < 0) {
            cout << 0 << "\n";
            return;
        }
        attr[a.first] = Max(attr[a.first], a.second.back());
        if (a.second.back() < attr[a.first])
        {
            prevs.push_back(a.first);
            res += attr[a.first] * a.second.size();
        }
        else
        {
            int i = a.second.size() - 2;
            while (i >= 0)
            {
                if (attr[a.first] != a.second[i])
                {
                    break;
                }
                i--;
            }
            prevs.push_back(a.first);
            res += attr[a.first] * (i+1);
        }
    }

    while (k--)
    {
        ll h = 0;
        string attribute;
        for (auto a : attr)
        {
            ll np = (find(all(prevs), a.first) != prevs.end()) ? res - (a.second) * (challs[a.first].size() - count(all(challs[a.first]), a.second)) + (a.second + 1) * challs[a.first].size() 
                                            : res + (a.second + 1) * challs[a.first].size();
            if (h < np)
            {
                h = np;
                attribute = a.first;
            }
        }
        prevs.push_back(attribute);
        attr[attribute]++;
        res = h;
    }
    cout << res << "\n";
    return;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    b();

    return 0;
}