#include <bits/stdc++.h>
using namespace std;
void add(long long bit[], int n, int x, long long a) {
  for (; x <= n; x += x & -x) {
    bit[x] += a;
  }
}
long long qry(long long bit[], int x) {
  long long r = 0;
  for (; x; x -= x & -x) {
    r += bit[x];
  }
  return r;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  int a[n + 2];
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  a[0] = 0, a[n + 1] = n + 1;
  int p[n + 2];
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
  }
  p[0] = p[n + 1] = 0;
  int m;
  cin >> m;
  int pr[n + 2];
  fill(pr, pr + n + 2, -1);
  int lb = 0;
  for (int i = 0; i < m; i++) {
    int b;
    cin >> b;
    pr[b] = lb;
    lb = b;
  }
  pr[n + 1] = lb;
  long long ss1[n + 2], ss2[n + 2];
  long long bit[n + 2];
  fill(bit, bit + n + 2, 0);
  for (int i = n + 1; i >= 0; i--) {
    if (pr[a[i]] != -1) {
      ss1[i] = qry(bit, a[i]);
      ss2[i] = pr[a[i]] <= 0 ? 0 : qry(bit, pr[a[i]]);
    }
    if (p[i] > 0) {
      add(bit, n + 1, a[i], p[i]);
    }
  }
  long long dp[n + 2], dpm[n + 2];
  fill(dpm, dpm + n + 2, -2e15);
  dp[0] = dpm[0] = 0;
  for (int i = 1; i <= n + 1; i++) {
    if (pr[a[i]] != -1) {
      dp[i] = dpm[pr[a[i]]] - ss2[i] + p[i];
      dpm[a[i]] = max(dpm[a[i]], dp[i] + ss1[i]);
    }
  }
  if (dp[n + 1] < -1e15) {
    cout << "NO" << endl;
  } else {
    cout << "YES" << endl;
    long long psum = 0;
    for (int i = 0; i <= n + 1; i++) {
      psum += p[i];
    }
    cout << psum - dp[n + 1] << endl;
  }
  return 0;
}
