A11736 | Mahmoud and Ehab and the message

The first line of input contains integers $n$ , $k$ and $m$ $(1<=k<=n<=10^{5},1<=m<=10^{5})$ — the number of words in their language, the number of groups of words, and the number of words in Mahmoud's message respectively.

The second line contains $n$ strings consisting of lowercase English letters of length not exceeding 20 which represent the words. It's guaranteed that the words are distinct.

The third line contains $n$ integers $a_{1}$ , $a_{2}$ , $...$ , $a_{n}$ $(1<=a_{i}<=10^{9})$ where $a_{i}$ is the cost of sending the $i$ -th word.

The next $k$ lines describe the groups of words of same meaning. The next $k$ lines each start with an integer $x$ $(1<=x<=n)$ which means that there are $x$ words in this group, followed by $x$ integers which represent the indices of words in this group. It's guaranteed that each word appears in exactly one group.

The next line contains $m$ space-separated words which represent Mahmoud's message. Each of these words appears in the list of language's words.

The only line should contain the minimum cost to send the message after replacing some words (maybe none) with some words of the same meaning.

In the first sample, Mahmoud should replace the word "second" with the word "loser" because it has less cost so the cost will be 100+1+5+1=107.

In the second sample, Mahmoud shouldn't do any replacement so the cost will be 100+1+5+10=116.