#include<bits/stdc++.h>
using namespace std;
struct apple{
	long long X;
	int Y;
	apple(long long X=0,int Y=0):X(X),Y(Y){}
	bool operator<(const apple &other)const{
		return X>other.X;
	}	
}e[100005];
map<string,pair<multiset<int>,int>>mp;
string a[100005];
int b[100005];
long long s[100005];
int main(){
	int n;
	long long m;
	cin>>n>>m;
	for(int i=1;i<=n;++i)cin>>a[i]>>b[i];
	int q;
	cin>>q;
	for(int i=1;i<=q;++i){
		string a;
		int b;
		cin>>a>>b;
		auto at=mp[a];
		at.first.emplace(b);
		++at.second;
		mp[a]=at;
	}
	long long ans=0;
	int tot=0;
	for(int i=1;i<=n;++i){
		if(!mp.count(a[i]))continue;
		auto at=mp[a[i]];
		int mx=0,gs=0;
		for(auto cu:at.first)mx=max(mx,cu);
		for(auto cu:at.first)if(cu!=mx)++gs;
		if(b[i]<=mx){
			m-=mx-b[i];
			b[i]=mx;
			ans+=1ll*b[i]*gs;
			e[++tot]=apple(1ll*(b[i]+1)*(at.second-gs)+gs,at.second);
		}else{
			ans+=1ll*b[i]*at.second;
			e[++tot]=apple(at.second,at.second);
		}
	}
	if(m<0){
		printf("0\n");
		return 0;
	}
	sort(e+1,e+tot+1);
	long long aa=0;
	for(int i=1;i<=tot;++i)s[i]=s[i-1]+e[i].X;
	for(int i=1;i<=tot;++i){
		if(!m)continue;
		int wz=lower_bound(e+1,e+tot+1,apple(e[i].Y,0))-e-1;
		if(wz>=i&&m>=i)wz=min(0ll+wz,m),aa=max(aa,s[wz]+1ll*(m-wz)*e[i].Y);
		else wz=min(0ll+wz,m-1),aa=max(aa,s[wz]+e[i].X+1ll*(m-wz-1)*e[i].Y);
	}
	cout<<ans+aa<<endl;
	return 0;
}