#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n,k;
	cin >> n >> k;
	map<string,int>hm;
	int cur = 0;
	vector<vector<int>>vals(200005);
	vector<int>arr(200005);
	for(int i = 1; i<=n; i++){
		string s;
		cin >> s;
		int v;
		cin >> v;
		if(!hm.count(s)){
			cur++; hm[s] = cur;
		}
		arr[hm[s]] = v;
	}
	int m;
	cin >> m;
	for(int i = 1; i<=m; i++){
		string s;
		cin >> s;
		int v;
		cin >> v;
		assert(hm[s]);
		vals[hm[s]].push_back(v);
	}
	vector<int>vec;
	int mx = 0;
	int ans = 0;
	int rq = 0;
	for(int i = 1; i<=cur; i++){
		if(vals[i].size()==0)continue;
		sort(vals[i].begin(),vals[i].end());
		rq+=max(0LL,vals[i].back()-arr[i]);
		mx = max(mx,(int)vals[i].size());
		if(vals[i].back()<arr[i]){
			ans+=vals[i].size()*arr[i];
			continue;
		}
		int cnt = 0;
		for(int nxt: vals[i]){
			if(nxt!=vals[i].back()){
				ans+=vals[i].back();
			}
			else{
				cnt++;
			}
		}
		vec.push_back(cnt*vals[i].back()+vals[i].size());
		
	}
	//cout << rq << '\n';
	if(rq > k){
		cout << "0\n";
		return 0;
	}
	//cout << rq << '\n';
	k-=rq;
	sort(vec.begin(),vec.end());
	while(vec.size() && k && vec.back() > mx){
		k--;
		ans+=vec.back();
		vec.pop_back();
	}
	ans+=k*mx;
	cout << ans << '\n';
	return 0;
}