Scribble

Nixed, he placed the flong into the calathi halfway through the yuga.

Huh?

Believe it or not, the sentence above is a perfectly valid English sentence. It also has two other qualities: it looks like spam, and its words are very valuable.

Valuable, you say? (For some reason, you keep talking to yourself today.)

Yes — valuable, if you are playing Scribble. In the standard game of Scribble, calathi ("a vase-shaped basket depicted in Greek painting and sculpture") is worth $72$ points, nixed ("refused") is worth $26$ points, flong ("a compressed mass of paper sheets forming a matrix or mold for stereotype plates") is worth $18$ points, and yuga ("any one of the four ages — Krita or Satya, Treta, Dwapara, and Kali — into which Hindu tradition divides the existence of the world") is worth $33$ points.

As you may know, each letter in Scribble is worth a fixed number of points, and the goal is to score as many points as possible from a given set of letters.

For this problem we change the rules slightly. You have $7$ tiles (letters), and each letter $\alpha$ has a score $s_\alpha$ with $0 \le s_\alpha \le 26$. Before you play, you may also consult a dictionary of valid words (unlike normal Scribble). Your task is to find the highest-scoring word you can form. The score of a word is the sum of the scores of its letters.

The first line contains an integer $k$ ($1 \le k \le 7$). Each of the next $k$ lines contains a triple $\alpha\ s_\alpha\ r_\alpha$, where $\alpha$ is a letter, $s_\alpha$ is that letter's score, and $r_\alpha$ is the number of tiles bearing that letter. You may assume $\sum_\alpha r_\alpha = 7$. For example, the triple a 7 2 means you have two a tiles, each worth $7$ points. The next line (line $k+2$) contains an integer $N$ ($0 \le N \le 100\,000$). Each of the following $N$ lines contains one word (each word has length at least one).

Output a single line containing one integer: the maximum score — the greatest number of points obtainable by using your tiles to form one complete word from the dictionary. If no word can be formed, output $0$.