#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <climits>
#include <bitset>
#include <chrono>
#include <random>
#include <functional>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

typedef long long ll;

#define O(i) i & 1
#define E(i) !O(i)
#define SZ(v) ((int)(v).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n) FORE(i,0,n)
#define FORSZ(i,a,v) FOR(i,a,SZ(v))
#define REPSZ(i,v) REP(i,SZ(v))

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

    ll n; cin >> n;
    ll k; cin >> k;
    unordered_map<string, ll> current;
    unordered_map<string, vector<ll>> maxFreq;
    while (n--) {
        string a; cin >> a;
        ll s; cin >> s;
        current[a] = s;
        maxFreq[a] = vector<ll>(3, 0);
    }

    ll l; cin >> l;
    ll highestFreq = 0;
    vector<pair<string, ll>> thingies;
    while(l--) {
        string a; cin >> a;
        ll t; cin >> t;
        thingies.emplace_back(a,t);

        maxFreq[a][0] = max(maxFreq[a][0], t);
        maxFreq[a][1]++;
        if (maxFreq[a][1] > highestFreq) {
            highestFreq = maxFreq[a][1];
        }
    }

    ll ans = 0;
    // calculate if possible to make all levels with k and update attributes
    for ( const auto &p : current ) {
        if (p.second < maxFreq[p.first][0]) {
            k = k + (p.second - maxFreq[p.first][0]);
            current[p.first] = maxFreq[p.first][0];
        }
        if (k < 0) {
            cout << '0' << '\n';
            return 0;
        }
    }

    // add up all the points gained by leveling up all attributes to pass
    for ( const auto &p : thingies ) {
        if (current[p.first] == p.second) {
            maxFreq[p.first][2]++;
        } else {
            ans = ans + current[p.first];
        }
    }


    priority_queue<ll> q;
    for ( const auto &p : current ) {
        ll newAttributeGain = p.second + 1;
        ll possiblePointsGained = newAttributeGain*maxFreq[p.first][2] + (maxFreq[p.first][1] - maxFreq[p.first][2]);
        if (possiblePointsGained > highestFreq) {
            q.push(possiblePointsGained);
        }
    }

    while (k > 0 && !q.empty()) {
        ans = ans + q.top();
        q.pop();
        k--;
    }

    cout << ans + k*highestFreq << '\n';

    return 0;
}