// https://static.oj.uz/problem/172ac20b69d3e59e0c7a115362d6e5/statement/632372d96ea2d9ac379024d4b68d7b71174ee5a1688d7bc72955237d7ff2b7de/statement_en.pdf
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int k , n , m , a , b;
cin >> k >> n >> m >> a >> b;
vector<int> v(k + 1);
for(int i = 1 ; i <= k ; i++) cin >> v[i];
vector<int> s(n) , t(m);
for(int i = 0; i< n;i++)cin>>s[i];
for(int i = 0 ; i < m ;i++)cin>>t[i];
vector<int> intersection;
int temp = 0;
for(int i = 0 ; i < m ; i++){
for(int j = temp ;j< n ; j++){
if(t[i] == s[j]){
intersection.push_back(t[i]);
temp = j;
break;
}
}
}
int sum = 0;
for(int i = 0 ; i < intersection.size() ; i++){
sum += v[intersection[i]];
// cout << intersection[i] << " " << v[intersection[i]] << " ";
}
cout << sum;
}
