#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using ulint = long long;
const int SOURCE = 0;
const int SINK = 1;
struct Edge {
  int from, to, capacity, cost;
};
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 char_cnt[26];
int main(void) {
  string t;
  int n;
  cin >> t >> n;
  vector<string> s(n);
  vector<int> lim(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i] >> lim[i];
  }
  vector<Edge> edges;
  int cnt = 2;
  for (int i = 0; i < n; i++) {
    edges.push_back({SOURCE, cnt++, lim[i], 0});
  }
  for (int i = 0; i < n; i++) {
    fill(begin(char_cnt), end(char_cnt), 0);
    for (char c : s[i]) {
      char_cnt[c - 'a']++;
    }
    for (int c = 0; c < 26; c++) {
      edges.push_back({2 + i, cnt + c, char_cnt[c], i + 1});
    }
  }
  fill(begin(char_cnt), end(char_cnt), 0);
  for (char c : t) {
    char_cnt[c - 'a']++;
  }
  for (int c = 0; c < 26; c++) {
    edges.push_back({cnt++, SINK, char_cnt[c], 0});
  }
  cout << min_cost_flow(cnt, edges, t.size(), SOURCE, SINK) << endl;
}
