#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) { a = max(a, b); }
template<class T> void chmin(T& a, const T& b) { a = min(a, b); }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;


template<class T, T (*add)(T, T), T (*zero)(), T (*mul)(T, T), T (*one)(), int N>
struct Mat : array<array<T, N>, N> {
  using M = Mat<T, add, zero, mul, one, N>;
  void make_identity() {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        (*this)[i][j] = zero();
      }
    }
    for (int i = 0; i < N; i++) {
      (*this)[i][i] = one();
    }
  }
  M& operator+=(const M& rhs) {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        (*this)[i][j] = add((*this)[i][j], rhs[i][j]);
      }
    }
    return *this;
  }
  M& operator*=(const M& rhs) {
    static M temp;
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        temp[i][j] = zero();
      }
    }
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        for (int k = 0; k < N; k++) {
          temp[i][k] = add(temp[i][k], mul((*this)[i][j], rhs[j][k]));
        }
      }
    }
    *this = temp;
    return *this;
  }
  template <class I>
  void inplace_pow(I k) {
    assert(k >= 0);
    static M temp;
    temp = *this;
    make_identity();
    while (k) {
      if (k & 1) *this *= temp;
      k >>= 1;
      if (k) temp *= temp;
    }
  }
  friend ostream& operator<<(ostream& os, const M& A) {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        os << A[i][j] << " \n"[j + 1 == N];
      }
    }
    return os;
  }
};

// tropical semiring
constexpr ll INF = 1002003004005006007;
ll add(ll x, ll y) { return max(x, y); }
ll zero() { return -INF; }
ll mul(ll x, ll y) { return x + y; }
ll one() { return 0; }

using M = Mat<ll, add, zero, mul, one, 16>;
M m;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int c[26], k[26];
  rep(i, 26) cin >> c[i], c[i]--;
  rep(i, 26) cin >> k[i];
  int n;
  cin >> n;
  struct Edge { int u, v, e; };
  vector<Edge> es[26];
  rep(_, n) {
    string s;
    int a, b, e;
    cin >> s >> a >> b >> e;
    a--, b--;
    for(char c : s) es[c - 'A'].push_back({a, b, e});
  }
  ll res[16]{};
  bool invalid[16]{};
  rep(i, 26) {
    m.make_identity();
    for (auto [u, v, e] : es[i]) {
      chmax<ll>(m[u][v], e);
      chmax<ll>(m[v][u], e);
    }
    m.inplace_pow(k[i]);
    rep(j, 16) if (!invalid[j]) {
      if (m[c[i]][j] < -INF / 10) invalid[j] = true;
      else res[j] += m[c[i]][j];
    }
  }
  ll ans = -INF;
  rep(j, 16) if (!invalid[j]) chmax(ans, res[j]);
  if (ans == -INF) {
    cout << "Impossible\n";
  } else {
    cout << ans << '\n';
  }
}