#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pairP; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; typedef double ld; typedef pair LDP; const ld eps = 1e-4; const ld pi = acosl(-1.0); template void chmin(T& a, T b) { a = min(a, b); } template void chmax(T& a, T b) { a = max(a, b); } template void cinarray(vector& v) { rep(i, v.size())cin >> v[i]; } template void coutarray(vector& v) { rep(i, v.size()) { if (i > 0)cout << " "; cout << v[i]; } cout << "\n"; } ll mod_pow(ll x, ll n, ll m = mod) { if (n < 0) { ll res = mod_pow(x, -n, m); return mod_pow(res, m - 2, m); } if (abs(x) >= m)x %= m; if (x < 0)x += m; if (x == 0)return 0; ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { int n; modint() :n(0) { ; } modint(ll m) { if (m < 0 || mod <= m) { m %= mod; if (m < 0)m += mod; } n = m; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } modint operator/=(modint& a, modint b) { a = a / b; return a; } const int max_n = 1 << 20; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } modint combP(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[a - b]; } ll gcd(ll a, ll b) { a = abs(a); b = abs(b); if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } int dx[4] = { 1,0,-1,0 }; int dy[4] = { 0,1,0,-1 }; ll dp[16][75]; ll cost[16][16]; void solve() { vector col(26); rep(i, 26) { cin >> col[i]; col[i]--; } vector num(26); rep(i, 26) { cin >> num[i]; } int n; cin >> n; vector s(n); vector a(n), b(n), e(n); rep(i, n) { cin >> s[i] >> a[i] >> b[i] >> e[i]; a[i]--; b[i]--; } vector ans(16); vector ban(16); rep(i, 26) { rep(j, 16)rep(k,71) { dp[j][k] = -INF; } dp[col[i]][0] = 0; rep(j, 16)rep(k, 16) { cost[j][k] = -INF; } rep(j, n) { bool exi = false; for (char c : s[j])if (c == 'A' + i)exi = true; if (exi) { chmax(cost[a[j]][b[j]], (ll)e[j]); chmax(cost[b[j]][a[j]], (ll)e[j]); } } rep(k, 70)rep(j, 16) { rep(to, 16) { chmax(dp[to][k + 1], dp[j][k] + cost[j][to]); } } rep(j, 16) { ll val = dp[j][0]; rep(k, min(71, num[i]+1)) { chmax(val, dp[j][k]); } if (num[i] <= 70) { if (val <= -INF / 2) { ban[j] = true; } else { ans[j] += val; } } else { if (val <= -INF / 2) { ban[j] = true; } else { for (int c = 69; c <= 70; c++) { if (dp[j][c] <= -INF / 2)continue; int dif = (num[i] - c) / 2; ll val2 = dp[j][c] + (dp[j][c] - dp[j][c - 2]) * dif; chmax(val, val2); } ans[j] += val; } } } } ll res = -INF; rep(j, 16) { if (ban[j])continue; chmax(res, ans[j]); } if (res == -INF) { cout << "Impossible" << "\n"; } else { cout << res << "\n"; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(8); init_f(); //init(); //while(true) //expr(); //init(); //int t; cin >> t; rep(i, t) solve(); return 0; }