Problem: Mahmoud wants to send a message to his friend Ehab. Their language consists of n words numbered from 1 to n. Some words have the same meaning so there are k groups of words such that all the words in some group have the same meaning.

Mahmoud knows that the i-th word can be sent with cost ai. For each word in his message, Mahmoud can either replace it with another word of the same meaning or leave it as it is. Can you help Mahmoud determine the minimum cost of sending the message?

The cost of sending the message is the sum of the costs of sending every word in it.

Input

The first line of input contains integers n, k and m (1 ≤ k ≤ n ≤ 105, 1 ≤ m ≤ 105) — 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 a1, a2, ..., an (1 ≤ ai ≤ 109) where ai 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.

Output

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.

Examples

Input

5 4 4
i loser am the second
100 1 1 5 10
1 1
1 3
2 2 5
1 4
i am the second


Output

107

Input

5 4 4
i loser am the second
100 20 1 5 10
1 1
1 3
2 2 5
1 4
i am the second


Output

116

Note

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.

Solution (in JAVA):

Solution:
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.*;
import java.util.Scanner;

public class DSU {

    final int MAX = (int) (10e5 + 2);
    int[] parent = new int[MAX];
    int[] rank = new int[MAX];
    int[] total = new int[MAX];

    public DSU(int n) {

        for (int i = 0; i < MAX; i++) {
            parent[i] = i;
        }
    }

    int FindLeader(int node) {
        return (parent[node] == node) ? node : (parent[node] = FindLeader(parent[node]));
    }

    boolean SameSet(int i, int k) {
        return FindLeader(i) == FindLeader(k);
    }

    void MergeGroup(int i, int k) {
        int px = FindLeader(i);
        int py = FindLeader(k);
        if(py==px)return;
            if (rank[px] <= rank[py]) {
                parent[py] = px;
                rank[py]=rank[px];
            } else {
                parent[px] = py;
               rank[px]=rank[py];
            }
        

    }

    int GetSize(int node) {
        int leader = FindLeader(node);
        return rank[leader];
    }

    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        try (PrintWriter or = new PrintWriter(System.out)) {
            int n=in.nextInt(),k=in.nextInt(),m=in.nextInt();
            Map<String,Integer> map = new TreeMap();
            DSU d= new DSU(n);
            String [] e= new String[n];
            for (int i = 0; i < n; ++i)     e[i]=in.next();
            for (int i = 0; i < n; ++i) {
                map.put(e[i], i);
                d.rank[i]=in.nextInt();
            }
            for (int i = 0; i < k; ++i) {
                int y=in.nextInt();
               if(y==1)in.nextInt();
               else {
                  int x=y;
                  int h=in.nextInt()-1;
                   while (y-->1) {                       
                       d.MergeGroup(h, in.nextInt()-1);
                   }
               }
            }
            long ans=0;
            for (int i = 0; i < m; i++) {
               String w=in.next();
               ans+=(long)(d.rank[d.FindLeader(map.get(w))]);
            }
            or.print(ans);
        }

    }

}