#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 110;
string str[MAX_N], a;
int cst[MAX_N];
struct Edge {
  int from, to, capacity, cost;
  Edge(int f, int t, int c, int co) {
    from = f;
    to = t;
    capacity = c;
    cost = co;
  }
};
vector<vector<int>> adj, cost, capacity;
const int INF = 1e9;
void shortest_paths(int n, int v0, vector<int>& d, vector<int>& p) {
  d.assign(n, INF);
  d[v0] = 0;
  vector<int> m(n, 2);
  deque<int> q;
  q.push_back(v0);
  p.assign(n, -1);
  while (!q.empty()) {
    int u = q.front();
    q.pop_front();
    m[u] = 0;
    for (int v : adj[u]) {
      if (capacity[u][v] > 0 && d[v] > d[u] + cost[u][v]) {
        d[v] = d[u] + cost[u][v];
        p[v] = u;
        if (m[v] == 2) {
          m[v] = 1;
          q.push_back(v);
        } else if (m[v] == 0) {
          m[v] = 1;
          q.push_front(v);
        }
      }
    }
  }
}
int min_cost_flow(int N, vector<Edge> edges, int K, int s, int t) {
  adj.assign(N, vector<int>());
  cost.assign(N, vector<int>(N, 0));
  capacity.assign(N, vector<int>(N, 0));
  for (Edge e : edges) {
    adj[e.from].push_back(e.to);
    adj[e.to].push_back(e.from);
    cost[e.from][e.to] = e.cost;
    cost[e.to][e.from] = -e.cost;
    capacity[e.from][e.to] = e.capacity;
  }
  int flow = 0;
  int cost = 0;
  vector<int> d, p;
  while (flow < K) {
    shortest_paths(N, s, d, p);
    if (d[t] == INF) break;
    int f = K - flow;
    int cur = t;
    while (cur != s) {
      f = min(f, capacity[p[cur]][cur]);
      cur = p[cur];
    }
    flow += f;
    cost += f * d[t];
    cur = t;
    while (cur != s) {
      capacity[p[cur]][cur] -= f;
      capacity[cur][p[cur]] += f;
      cur = p[cur];
    }
  }
  if (flow < K)
    return -1;
  else
    return cost;
}
int cnt[100];
vector<Edge> e;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> a;
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= 26; j++) {
      cnt[j] = 0;
    }
    cin >> str[i] >> cst[i];
    e.emplace_back(0, i, cst[i], i);
    for (int j = 0; j < str[i].size(); j++) {
      cnt[str[i][j] - 'a' + 1]++;
    }
    for (int j = 1; j <= 26; j++) {
      e.emplace_back(i, 150 + j, cnt[j], 0);
    }
  }
  for (int j = 1; j <= 26; j++) {
    cnt[j] = 0;
  }
  for (int i = 0; i < a.size(); i++) {
    cnt[a[i] - 'a' + 1]++;
  }
  for (int i = 1; i <= 26; i++) {
    e.emplace_back(150 + i, 200, cnt[i], 0);
  }
  cout << min_cost_flow(201, e, a.size(), 0, 200);
  return 0;
}
