#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
int n, a[N], m, b[N];
long long p[N], dp[N], val[N][2], ans;
long long t[4 * N];
void add(int v, int l, int r, int pos, long long val) {
  if (l == r) {
    t[v] += val;
    return;
  }
  int m = (l + r) / 2;
  if (pos <= m)
    add(v * 2, l, m, pos, val);
  else
    add(v * 2 + 1, m + 1, r, pos, val);
  t[v] = t[v * 2] + t[v * 2 + 1];
}
long long get(int v, int l, int r, int i, int j) {
  if (i > j) return 0;
  if (l == i && r == j) return t[v];
  int m = (l + r) / 2;
  return get(v * 2, l, m, i, min(j, m)) +
         get(v * 2 + 1, m + 1, r, max(m + 1, i), j);
}
int last[N];
vector<pair<int, int>> lav[N];
vector<int> upd[N];
long long best[N];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  for (int i = 1; i <= n; i++) scanf("%lld", p + i);
  cin >> m;
  for (int i = 1; i <= m; i++) scanf("%d", b + i);
  for (int i = 1; i <= n; i++) last[i] = -1;
  for (int i = 1; i <= m; i++) last[b[i]] = b[i - 1];
  lav[0].push_back(make_pair(0, 1));
  for (int i = 1; i <= n; i++) {
    if (last[a[i]] != -1) {
      lav[a[i]].push_back(make_pair(i, 1));
      lav[last[a[i]]].push_back(make_pair(i, 0));
    }
    if (p[i] < 0)
      add(1, 0, n, i, p[i]);
    else
      upd[a[i]].push_back(i);
  }
  for (int i = n; i >= 0; i--) {
    best[i] = 1000000007ll * 1000000007ll;
    for (int j = 0; j < lav[i].size(); j++)
      val[lav[i][j].first][lav[i][j].second] =
          get(1, 0, n, lav[i][j].first + 1, n);
    for (int j = 0; j < upd[i].size(); j++)
      add(1, 0, n, upd[i][j], p[upd[i][j]]);
  }
  best[0] = val[0][1];
  for (int i = 1; i <= n; i++) {
    if (last[a[i]] == -1) continue;
    dp[i] = 1000000007ll * 1000000007ll;
    if (best[last[a[i]]] != 1000000007ll * 1000000007ll)
      dp[i] = best[last[a[i]]] - val[i][0] - p[i];
    if (dp[i] != 1000000007ll * 1000000007ll)
      best[a[i]] = min(best[a[i]], dp[i] + val[i][1]);
  }
  ans = best[b[m]];
  if (ans == 1000000007ll * 1000000007ll) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  cout << ans << endl;
  return 0;
}
