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

using ll = long long;

ll scores[100005];

int freq[100005];
ll frst[100005];

int attr[100005];
ll threshold[100005];
ll spend;
int n, m;

int get_attr() {
  static map<string, int> id;
  char buf[26];
  scanf("%s", buf);
  string s(buf);
  auto it = id.find(s);
  if (it != id.end())
    return it->second;
  int l = id.size();
  id[s] = l;
  return l;
}


int main() {
  scanf("%d%lld", &n, &spend);
  for (int i = 0; i < n; i++) {
    int a = get_attr();
    scanf("%lld", scores+i);
  }
  scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    attr[i] = get_attr();
    scanf("%lld", threshold+i);
  }

  // make sure we don't die
  for (int i = 0; i < m; i++) {
    if (scores[attr[i]] < threshold[i]) {
      ll diff = threshold[i] - scores[attr[i]];
      spend -= diff;
      scores[attr[i]] += diff;
    }
  }
  if (spend < 0) {
    printf("0\n");
    return 0;
  }

  // get current score
  ll ans = 0;
  for (int i = 0; i < m; i++)
    if (threshold[i] < scores[attr[i]])
      ans += scores[attr[i]];

  // spend extra
  for (int i = 0; i < m; i++) {
    freq[attr[i]]++;
    if (threshold[i] == scores[attr[i]]) {
      frst[attr[i]]++;
    }
  }

  ll gradient = 0;
  for (int i = 0; i < n; i++)
    gradient = max(gradient, (ll)freq[attr[i]]);
  vector<ll> alt;
  for (int i = 0; i < n; i++) {
    alt.push_back(frst[i] * scores[i] + freq[i]);
  }
  sort(alt.begin(), alt.end(), greater<ll>());
  for (ll u: alt)
    if (u > gradient && spend > 0) {
      spend--;
      ans += u;
    }

  ans += spend * gradient;
  printf("%lld\n", ans);
  return 0;
}