#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=1;i<=n;++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define st first
#define nd second
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
int n,k,l;
map<string,int>a;
map<string,vi>e;
ll ans,infmx;
vector<ll>ftp;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>k;
    rep(i,n){
        string s;int x;
        cin>>s>>x;
        a[s]=x;
    }
    cin>>l;
    rep(i,l){
        string s;int x;
        cin>>s>>x;
        e[s].pb(x);
    }
    ans=infmx=0;
    for(auto p:a){
        vi&v=e[p.st];
        if(v.size()==0)continue;
        sort(all(v));
        int mx=v.back();
        if(mx>=p.nd){
            k-=mx-p.nd;
            ll cnt=0;
            for(int x:v)if(x<mx)ans+=mx;else ++cnt;
            infmx=max(infmx,(ll)v.size());
            ftp.pb(cnt*mx+v.size());
        }else{
            for(int x:v)ans+=p.nd;
            infmx=max(infmx,(ll)v.size());
        }
    }
    sort(all(ftp));
    if(k<0)cout<<0<<endl;
    else{
        while(k>0&&ftp.size()>0&&ftp.back()>infmx){
            ans+=ftp.back();
            --k;
            ftp.pop_back();
        }
        ans+=k*infmx;
        cout<<ans<<endl;
    }
    return 0;
}