#include <bits/stdc++.h>
using namespace std;
const int seed = 131;
const long long LLMAX = 2e18;
const int MOD = 1e9 + 7;
const double eps = 1e-8;
const int MAXN = 1e6 + 10;
const int hmod1 = 0x48E2DCE7;
const int hmod2 = 0x60000005;
inline long long sqr(long long x) { return x * x; }
inline int sqr(int x) { return x * x; }
inline double sqr(double x) { return x * x; }
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long exgcd(long long a, long long b, long long &x, long long &y) {
  long long d;
  (b == 0 ? (x = 1, y = 0, d = a)
          : (d = exgcd(b, a % b, y, x), y -= a / b * x));
  return d;
}
long long qpow(long long a, long long n) {
  long long sum = 1;
  while (n) {
    if (n & 1) sum = sum * a % MOD;
    a = a * a % MOD;
    n >>= 1;
  }
  return sum;
}
inline int dcmp(double x) {
  if (fabs(x) < eps) return 0;
  return (x > 0 ? 1 : -1);
}
long long bit[MAXN], res;
int a[MAXN], b[MAXN], p[MAXN];
void update(int x, int n, long long v) {
  for (int i = x; i <= n; i += (i & (-i))) bit[i] += v;
}
long long query(int x) {
  long long sum = 0;
  for (int i = x; i; i -= (i & (-i))) sum += bit[i];
  return sum;
}
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) cin >> p[i], res += p[i];
  int m;
  cin >> m;
  for (int i = 1; i <= m; i++) cin >> b[i];
  update(1, n, -1e16);
  for (int i = 1; i <= n; i++) {
    int x = lower_bound(b + 1, b + m + 1, a[i]) - b;
    if (p[i] > 0) update(a[i], n, p[i]);
    if (x <= m && a[i] == b[x]) {
      long long sum = (x == 1 ? p[i] : query(b[x - 1]) + p[i]),
                cur = query(b[x]);
      if (sum > cur) update(b[x], n, sum - cur), update(b[x] + 1, n, cur - sum);
    }
  }
  long long cur = query(b[m]);
  if (cur < -1e15)
    cout << "NO" << endl;
  else
    cout << "YES" << endl << res - cur << endl;
  return 0;
}
