#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

using int64 = long long;
using int128 = __int128_t;
using ii = pair<int, int>;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
// mt19937 mrand(random_device{}());
// int rnd(int x) { return mrand() % x; }
mt19937_64 mrand(random_device{}());
int64 rnd(int64 x) { return mrand() % x; }
int lg2(int64 x) { return sizeof(int64) * 8 - 1 - __builtin_clzll(x); }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
void add_mod(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }
void sub_mod(int& x, int y) { x += MOD - y; if (x >= MOD) x -= MOD; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  string s;
  cin >> s;
  int n = SZ(s);
  vector<int> w(n);
  for (int i = 0; i < n; ++i) cin >> w[i];

  string company = "AEIOU";
  vector<int> a(n), cnt(5), sum(5);
  for (int i = 0; i < n; ++i) {
    if (s[i] == 'X') {
      a[i] = -1;
    } else {
      a[i] = company.find(s[i]);
      sum[a[i]] += w[i];
      cnt[a[i]]++;
    }
  }

  int m;
  cin >> m;
  while (m--) {
    int x;
    cin >> x;
    --x;
    if (a[x] != -1) {
      sum[a[x]] -= w[x];
      cnt[a[x]]--;
      a[x] = -1;
    }
  }

  cin >> s;
  if (s != "X") {
    for (auto& c : s) cnt[company.find(c)]++;
  }

  int ret = inf<int>;
  vector<int> p(5);
  iota(p.begin(), p.end(), 0);

  do {
    // trace(p, a, cnt, sum);
    auto dp = vect<int>(-1, n, 5);
    function<int(int, int)> solve =
      [&](int pos, int stage) {
        if (stage == 5) return 0;
        if (pos == n) return inf<int>;
        int& ret = dp[pos][stage];
        if (ret >= 0) return ret;
        ret = inf<int>;
        int k = p[stage], cost = sum[k];
        for (int i = pos; i + cnt[k] <= n; ++i) {
          if (i == pos) {
            for (int j = 0; j < cnt[k]; ++j) {
              if (a[i + j] == k) cost -= w[i + j];
            }
          } else {
            if (a[i - 1] == k) cost += w[i - 1];
            if (a[i + cnt[k] - 1] == k) cost -= w[i + cnt[k] - 1];
          }
          // trace(stage, k, cost, pos, cnt[k], n);
          int cur = cost + solve(i + cnt[k], stage + 1);
          ckmin(ret, cur);
        }
        return ret;
      };
    int cur = solve(0, 0);
    ckmin(ret, cur);
    // break;
  } while (next_permutation(p.begin(), p.end()));

  cout << ret << '\n';
  return 0;
}