#include <bits/stdc++.h>
using namespace std;
mt19937 gen(time(NULL));
const long double eps = 1e-9;
const int inf = 1e9;
const int mod = 1e9 + 7;
const long long infinity = 2 * 1e18;
struct flow {
 private:
  struct edge {
    int to, c, f, w;
  };
  vector<vector<int>> g;
  vector<edge> e;
  int n, m = 0;
  vector<bool> used;
  vector<long long> d;
  vector<int> inqueue, p2;

 public:
  flow() {}
  flow(int n) : n(n) {
    g.resize(n + 1);
    used.resize(n + 1);
    d.resize(n + 1);
    inqueue.resize(n + 1);
    p2.resize(n + 1);
  }
  void add(int u, int v, int c, int w) {
    g[u].push_back(2 * m), g[v].push_back(2 * m + 1);
    e.push_back({v, c, 0, w});
    e.push_back({u, 0, 0, -w});
    m++;
  }
  bool spfa(int u, int to) {
    fill(d.begin(), d.end(), infinity);
    fill(p2.begin(), p2.end(), -1);
    d[u] = 0;
    deque<int> q;
    inqueue[u] = 1;
    q.push_front(u);
    while (q.size()) {
      int x = q.front();
      q.pop_front();
      inqueue[x] = 0;
      for (auto v : g[x]) {
        auto &ee = e[v];
        if (ee.c - ee.f > 0 && d[ee.to] > d[x] + ee.w) {
          p2[ee.to] = v;
          d[ee.to] = d[x] + ee.w;
          if (!inqueue[ee.to]) {
            inqueue[ee.to] = 1;
            if (q.empty() || d[q.front()] > d[ee.to])
              q.push_front(ee.to);
            else
              q.push_back(ee.to);
          }
        }
      }
    }
    return d[to] != infinity;
  }
  long long mincost(int u, int v, int k) {
    long long cost = 0;
    while (spfa(u, v) && k) {
      k--;
      for (int x = p2[v]; x != -1; x = p2[e[x ^ 1].to]) {
        e[x].f++;
        e[x ^ 1].f--;
      }
      cost += d[v];
    }
    return (k ? -1 : cost);
  }
};
int n, w[200005];
string t;
string s[200005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> t;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> s[i] >> w[i];
  flow f = flow(n + 27);
  for (int i = 1; i <= n; i++) f.add(0, i, w[i], i);
  map<char, int> x;
  for (auto v : t) x[v]++;
  for (auto v : x) f.add(n + v.first + 1 - 'a', n + 27, v.second, 0);
  for (int i = 1; i <= n; i++) {
    map<char, int> x;
    for (auto v : s[i]) x[v]++;
    for (auto v : x) f.add(i, n + v.first + 1 - 'a', v.second, 0);
  }
  cout << f.mincost(0, n + 27, t.length());
}
