Problem: Let's denote the following function f. This function takes an array a of length n and returns an array. Initially the result is an empty array. For each integer i from 1 to n we add element a_i to the end of the resulting array if it is greater than all previous elements (more formally, if a_i > max_{1 ≤ j < i}a_j). Some examples of the function f:

  1. if a = [3, 1, 2, 7, 7, 3, 6, 7, 8] then f(a) = [3, 7, 8]; 
  2. if a = [1] then f(a) = [1]; 
  3. if a = [4, 1, 1, 2, 3] then f(a) = [4]; 
  4. if a = [1, 3, 1, 2, 6, 8, 7, 7, 4, 11, 10] then f(a) = [1, 3, 6, 8, 11]. 



You are given two arrays: array a_1, a_2, ... , a_n and array b_1, b_2, ... , b_m. You can delete some elements of array a (possibly zero). To delete the element a_i, you have to pay p_i coins (the value of p_i can be negative, then you get |p_i| coins, if you delete this element). Calculate the minimum number of coins (possibly negative) you have to spend for fulfilling equality f(a) = b.

Input

The first line contains one integer n (1 ≤ n ≤ 5 ⋅ 10^5) — the length of array a.

The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ n) — the array a.

The third line contains n integers p_1, p_2, ..., p_n (|p_i| ≤ 10^9) — the array p.

The fourth line contains one integer m (1 ≤ m ≤ n) — the length of array b.

The fifth line contains m integers b_1, b_2, ..., b_m (1 ≤ b_i ≤ n, b_{i-1} < b_i) — the array b.

Output

If the answer exists, in the first line print YES. In the second line, print the minimum number of coins you have to spend for fulfilling equality f(a) = b.

Otherwise in only line print NO.

Examples

Input


11
4 1 3 3 7 8 7 9 10 7 11
3 5 0 -2 5 3 6 7 8 2 4
3
3 7 10


Output


YES
20


Input


6
2 1 5 3 6 5
3 -9 0 16 22 -14
4
2 3 5 6


Output


NO

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353, N = 510000;
const long long inf = 1e16;
int n, m, a[N], p[N], b[N];
long long f[N], sum[N], tree[N];
vector<int> pos[N];
inline void modify(int x, int w) {
  while (x <= n) tree[x] += w, x += x & -x;
  return;
}
inline long long query(int x) {
  long long ret = 0;
  while (x) ret += tree[x], x -= x & -x;
  return ret;
}
inline int addMod(int a, int b) { return (a += b) >= mod ? a - mod : a; }
inline long long quickpow(long long base, long long pw) {
  long long ret = 1;
  while (pw) {
    if (pw & 1) ret = ret * base % mod;
    base = base * base % mod, pw >>= 1;
  }
  return ret;
}
template <class T>
inline void read(T &x) {
  x = 0;
  char ch = getchar(), w = 0;
  while (!isdigit(ch)) w = (ch == '-'), ch = getchar();
  while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
  x = w ? -x : x;
  return;
}
int main() {
  read(n);
  for (register int i = 1; i <= n; ++i) {
    read(a[i]);
    pos[a[i]].push_back(i);
  }
  pos[0].push_back(0);
  for (register int i = 1; i <= n; ++i) read(p[i]);
  read(m);
  for (register int i = 1; i <= m; ++i) read(b[i]);
  for (register int i = 1; i <= n; ++i) {
    sum[i] = sum[i - 1] + min(p[i], 0);
    modify(i, max(p[i], 0));
  }
  for (register int i = 1; i <= m; ++i) {
    long long minP = inf;
    auto it = pos[b[i - 1]].begin();
    for (auto &v : pos[b[i]]) {
      while (it != pos[b[i - 1]].end() && *it <= v)
        minP = min(minP, f[*it] - sum[*it] - query(*it)), ++it;
      f[v] = minP + sum[v - 1] + query(v - 1);
    }
    for (register int j = b[i - 1] + 1; j <= b[i]; ++j)
      for (auto &v : pos[j]) modify(v, -max(p[v], 0));
  }
  long long ans = inf;
  for (auto &v : pos[b[m]])
    ans = min(ans, f[v] + sum[n] - sum[v] + query(n) - query(v));
  if (ans >= inf / 2)
    printf("NO\n");
  else
    printf("YES\n%lld\n", ans);
  return 0;
}