Mahmoud and Ehab and the messag

B. Mahmoud and Ehab and the message

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 a_i. 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 ≤ 10⁵, 1 ≤ m ≤ 10⁵) — 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₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹) 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.

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

Copy

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

Copy

107

Input

Copy

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

Copy

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.

题意：给定几个某国单词，这些单词有一定的花费，再给这些单词分组，同组的单词具有相同的意思（即可以互相替换），现在要写一些给定的单词，求写完这些单词的最小花费。

分析：做起来不难，但是要用到STL，一开始用的vector，然后超时，后来用了map<string,int>就好了。思路就是把同组的单词都变成最小值就ok了。

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<vector>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<deque>
#include<ctype.h>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<algorithm>
#define INF 0x3f3f3f3f
#define gcd(a,b) __gcd(a,b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define FAST_IO ios::sync_with_stdio(false)
const double PI = acos(-1.0);
const double eps = 1e-6;
const int MAX=1e5+10;
const int mod=1e9+7;
typedef long long ll;
using namespace std;

inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
inline ll qpow(ll a,ll b){ll r=1,t=a; while(b){if(b&1)r=(r*t)%mod;b>>=1;t=(t*t)%mod;}return r;}
inline ll inv1(ll b){return qpow(b,mod-2);}
inline ll exgcd(ll a,ll b,ll &x,ll &y){if(!b){x=1;y=0;return a;}ll r=exgcd(b,a%b,y,x);y-=(a/b)*x;return r;}
inline ll read(){ll x=0,f=1;char c=getchar();for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;for(;isdigit(c);c=getchar()) x=x*10+c-'0';return x*f;}
ll n,k,m,x,y;
ll a[100005];
ll b[100005];
string s[100005];
map<string,int>mp;
int main()
{
    ll i,j;
    scanf("%lld%lld%lld",&n,&k,&m);
    for(i=1;i<100005;i++)
        a[i]=1e18;

    for(i=1;i<=n;i++)
        cin>>s[i];

    for(i=1;i<=n;i++)
        scanf("%lld",&b[i]);

    for(i=1;i<=k;i++)
    {
        cin>>x;
        for(j=1;j<=x;j++)
        {
            cin>>y;
            a[i]=min(a[i],b[y]);
            mp[s[y]]=i;
        }
    }

    ll ans=0;
    string t;
    for(i=1;i<=m;i++)
    {
        cin>>t;
        ans+=a[mp[t]];
    }
    printf("%lld\n",ans);
    return 0;
}