#include <bits/stdc++.h>
const int mod = 998244353;
using namespace std;
inline int read() {
  char ch = getchar();
  int f = 1, x = 0;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
const int N = 500005;
int n, m, a[N], b[N], id[N], pre[N];
long long t[N], dp[N], val[N], ans = 1e16, profit, sum, p[N], s[N];
bool judge() {
  for (int i = 1, j = 1; i <= n; i++) {
    if (a[i] == b[j]) j++;
    if (j > m) return 1;
  }
  return 0;
}
void update(int i, long long x) {
  for (; i <= n; i += i & -i) t[i] += x;
}
long long query(int i) {
  long long ans = 0LL;
  for (; i; i -= i & -i) ans += t[i];
  return ans;
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  for (int i = 1; i <= n; i++) p[i] = read();
  m = read();
  for (int i = 1; i <= m; i++) b[i] = read(), id[b[i]] = i, dp[i] = 1e15;
  if (judge())
    puts("YES");
  else
    return printf("NO"), 0;
  for (int i = 1; i <= n; i++) {
    int now = id[a[i]];
    if (now) {
      val[i] = dp[now - 1] + query(n) - query(b[now - 1]) + s[i - 1] -
               s[pre[now - 1]];
      dp[now] = min(dp[now] + s[i - 1] - s[pre[now]] + ((p[i] < 0) ? p[i] : 0),
                    dp[now - 1] + query(b[now]) - query(b[now - 1]) + s[i - 1] -
                        s[pre[now - 1]]);
      if (p[i] > 0) update(a[i], p[i]);
      s[i] = s[i - 1] + ((p[i] < 0) ? p[i] : 0);
      pre[now] = i;
    } else {
      if (p[i] < 0)
        profit += p[i];
      else
        update(a[i], p[i]);
      s[i] = s[i - 1];
    }
  }
  for (int i = n; i >= 1; i--) {
    if (a[i] == b[m]) ans = min(ans, val[i] + sum);
    if (a[i] > b[m] && p[i] > 0) sum += p[i];
    if (id[a[i]] != 0 && p[i] < 0) sum += p[i];
  }
  cout << ans + profit;
  return 0;
}
