#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)

#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()

#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;

template<class T>
ostream &operator<<(ostream &os, const vector <T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T, class U>
ostream &operator<<(ostream &os, const pair <T, U> &p) {
    return os << "(" << p.first << " " << p.second << ")";
}

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;

const ll MOD = 1e9 + 7;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
const ld eps = 1e-9;

template<typename T>
struct edge {
    int src, to;
    T cost;
};

template<typename T>
using Graph = vector<vector<edge<T>>>;

using State = string::const_iterator;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    // ifstream in("in.txt");
    // cin.rdbuf(in.rdbuf());

    for (;;) {
        int n; cin >> n;
        if (n == 0) break;

        vi HP(n); REP(i, n) cin >> HP[i];
        const int HPMAX = *max_element(ALL(HP));

        int m; cin >> m;
        vi allMP, allDamage, singleMP, singleDamage;
        REP(i, m) {
            string name, target;
            int mp, damage;
            cin >> name >> mp >> target >> damage;
            if (target == "All") {
                allMP.push_back(mp);
                allDamage.push_back(damage);
            }
            if (target == "Single") {
                singleMP.push_back(mp);
                singleDamage.push_back(damage);
            }
        }

        vi allDP(HPMAX+1, INF), singleDP(HPMAX+1, INF);
        allDP[0] = singleDP[0] = 0;
        REP(i, SZ(allMP)) {
            REP(d, HPMAX+1) {
                if (allDP[d] == INF) continue;
                chmin(allDP[min(d + allDamage[i], HPMAX)], allDP[d] + allMP[i]);
            }
        }
        REP(i, SZ(singleMP)) {
            REP(d, HPMAX+1) {
                if (singleDP[d] == INF) continue;
                chmin(singleDP[min(d + singleDamage[i], HPMAX)], singleDP[d] + singleMP[i]);
            }
        }

        RREP(d, HPMAX) {
            chmin(allDP[d], allDP[d+1]);
            chmin(singleDP[d], singleDP[d+1]);
        }

        int ans = INF;

        REP(a, HPMAX+1) {
            bool valid = 1;
            if (allDP[a] == INF) valid = 0;
            int sum = allDP[a];
            REP(i, n) {
                if (singleDP[max(HP[i] - a, 0)] == INF) valid = 0;
                sum += singleDP[max(HP[i] - a, 0)];
            }
            if (valid) chmin(ans, sum);
        }

        cout << ans << endl;
    }

    return 0;
}




Measured memory_bytes: 3740