#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
const ll mod = (ll)10000010*(ll)10000010*(ll)30;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

template<typename T>
struct Matrix{
  vector<vector<T>> val;
  Matrix(){}
  Matrix(int n,int m,T x=e_ADD()):val(n,vector<T>(m,x)){}
  Matrix(vector<vector<T>> a):val(a){}
  size_t size() const {return val.size();}
  inline vector<T>& operator [] (int i) {return val[i];}

  using MULT = function<T(T,T)>;
  using ADD = function<T(T,T)>;

  static MULT &get_mult(){
    static MULT mult = nullptr;
    return mult;
  }

  static T &e_MULT(){
    static T em = 1;
    return em;
  }

  static void set_mult(MULT f,T e) {
    get_mult() = f;
    e_MULT() = e;
  }

  static T &e_ADD(){
    static T ea = 0;
    return ea;
  }

  static ADD &get_add(){
    static ADD add = nullptr;
    return add;
  }

  static void set_add(ADD f,T e) {
    get_add() = f;
    e_ADD() = e;
  }

  Matrix<T> &operator=(const vector<vector<T>> &A) {
    int n=A.size(),m=A[0].size();
    val=A;
    return *this;
  }

  Matrix<T> &operator+=(const Matrix<T> &A) {
    assert(get_add() != nullptr);
    for (int i=0;i<val.size();++i)
      for (int j=0;j<val[0].size();++j)
        val[i][j]=get_add()(val[i][j],A.val[i][j]);   
    return *this;
  }
  Matrix<T> &operator+=(const vector<vector<T>> &A) { return *this += Matrix(A); }


  Matrix<T> &operator*=(const Matrix<T> &A) {
    assert(get_add() != nullptr);
    assert(get_mult() != nullptr);
    Matrix<T> R(val.size(),A.val[0].size());
    for (int i = 0; i < val.size(); ++i) 
      for (int j = 0; j < A.val[0].size(); ++j)
        for (int k = 0; k < A.size(); ++k) 
          R[i][j] = get_add()(R[i][j],get_mult()(val[i][k],A.val[k][j])); 
    for (int i=0;i<val.size();++i) 
      for (int j=0;j<val[0].size();++j)
        val[i][j]=R.val[i][j]; 
    return *this;
  }
  Matrix<T> &operator*=(const vector<vector<T>> &A) { return *this *= Matrix(A); }

  Matrix<T> operator+(const Matrix<T> &p) const { return Matrix<T>(*this) += p; }
  Matrix<T> operator-(const Matrix<T> &p) const { return Matrix<T>(*this) -= p; }
  Matrix<T> operator*(const Matrix<T> &p) const { return Matrix<T>(*this) *= p; }

  bool operator==(const Matrix<T> &p) const { return val == p.val; }
  bool operator!=(const Matrix<T> &p) const { return val != p.val; }

  Matrix<T> pow(long long n) {
    Matrix<T> A=*this;
    Matrix<T> R(A.size(), A.size(),e_ADD());
    for (int i = 0; i < A.size(); ++i) R[i][i] = e_MULT();
    while (n > 0) {
      if (n & 1) R = R * A;
      A = A * A;
      n >>= 1;
    }
  return R;
  }

};

using Mat = Matrix<ll>;

int C[26],K[26],n,m=16,l=26;
vector<bool> S[200010];int A[200010],B[200010];ll E[200010];
Mat mat[26],M[26];
ll ans[16];bool ng[16];

void solve(){
    auto add=[](ll a,ll b){return max(a,b);};
    auto mult=[](ll a,ll b){return a+b;};
    Mat::set_add(add,-INF);
    Mat::set_mult(mult,0);
    rep(i,26) {
        cin >> C[i];C[i]--;
    }
    rep(i,26) cin >> K[i];
    cin >> n;
    rep(i,n){
        string s;
        cin >> s >> A[i] >> B[i] >> E[i];
        A[i]--;B[i]--;
        S[i].resize(l,0);
        rep(j,s.length()){
            S[i][s[j]-'A']=1;
        }
    }
    rep(i,l){
        mat[i]=Mat(m,m,-INF);
        rep(j,m){
            mat[i][j][j]=0;
        }
        rep(j,n){
            if(S[j][i]) {
                chmax(mat[i][A[j]][B[j]],E[j]);
                chmax(mat[i][B[j]][A[j]],E[j]);
            }
        }
        M[i]=mat[i].pow(K[i]);
        rep(j,m){
            //cout << M[i][C[i]][j] << " ";
            if(M[i][C[i]][j]==-INF) ng[j]=true;
            ans[j]+=M[i][C[i]][j];
        }
        //cout << "" << endl;
        // rep(p,m){
        //     rep(q,m){
        //         cout << mat[i][p][q] << " ";
        //     }
        //     cout << "" << endl;
        // }
    }
    ll A=-INF;
    rep(i,m){
        //cout << i << " " << ans[i] << endl;
        if(!ng[i]) chmax(A,ans[i]);
    }
    if(A<-INF+mod) cout << "Impossible" << endl;
    else cout << A << endl;
}


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