#Greedy 解法 (TLE)

def member_id(alpha):
    return ord(alpha)-65 # ord("A")=65

C=list(map(int,input().split()))
K=list(map(int,input().split()))

inf=float("inf"); number=16; member=26
M=[[] for _ in range(member)]
N=int(input())

for _ in range(N):
    S,A,B,E=input().split()
    A=int(A)-1; B=int(B)-1; E=int(E)
    for s in S:
        t=member_id(s)
        M[t].append((A,B,E))

Data=[[-inf]*number for _ in range(member)]
for alpha in range(member):
    DP=[-inf]*number; DP[C[alpha]-1]=0
    Data[alpha][C[alpha]-1]=0

    for _ in range(K[alpha]):
        E=DP
        DP=[-inf]*number

        for a,b,e in M[alpha]:
            DP[a]=max(DP[a],E[b]+e)
            DP[b]=max(DP[b],E[a]+e)

        for c in range(number):
            Data[alpha][c]=max(Data[alpha][c],DP[c])

F=[0]*number
for alpha in range(member):
    for c in range(number):
        F[c]+=Data[alpha][c]

Ans=max(F)
print(Ans if Ans>-inf else "Impossible")