#include <bits/stdc++.h>
#define SIZE 100005
using namespace std;
typedef long long int ll;

char str[SIZE];
int st[SIZE];
vector <int> query[SIZE];
int main(){
	int n,k;
	scanf("%d%d",&n,&k);
	map <string,int> mp;
	for(int i=0;i<n;i++){
		scanf("%s%d",&str,&st[i]);
		string S=str;
		mp[S]=i;
	}
	int q;
	scanf("%d",&q);
	for(int i=0;i<q;i++){
		int t;
		scanf("%s%d",&str,&t);
		string S=str;
		query[mp[S]].push_back(t);
	}
	ll ret=0;
	vector <ll> vec;
	int nm=0;
	for(int i=0;i<n;i++){
		if(query[i].empty()) continue;
		sort(query[i].begin(),query[i].end(),greater <int>());
		int mx=query[i][0];
		k-=max(0,mx-st[i]);
		if(k<0){
			puts("0");
			return 0;
		}
		ll c=0;
		for(int j=0;j<query[i].size();j++){
			if(query[i][j]<max(st[i],mx)){
				ret+=max(st[i],mx);
			} else c+=mx;
		}
		vec.push_back(c+query[i].size());
		nm=max(nm,(int) query[i].size());
	}
	sort(vec.begin(),vec.end(),greater <ll>());
	for(int i=0;i<vec.size();i++){
		if(vec[i]<=nm||k<0) continue;
		ret+=vec[i];
		k--;
	}
	ret+=(ll) k*nm;
	printf("%lld\n",ret);
}