#include <bits/stdc++.h>
using namespace std;
int t, q, p[1000002], n;
bool neg[1000002];
int seq[1000002];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> p[i];
  cin >> t;
  for (int i = 0; i < t; ++i) {
    cin >> q;
    neg[q - 1] = 1;
  }
  stack<int> s;
  for (int i = 0; i < n; ++i) {
    if (neg[n - i - 1] == 1) {
      s.push(p[n - i - 1]);
      seq[n - i - 1] = -p[n - i - 1];
    } else {
      if (s.empty()) {
        s.push(p[n - i - 1]);
        seq[n - i - 1] = -p[n - i - 1];
      } else {
        if (p[n - i - 1] == s.top()) {
          seq[n - i - 1] = p[n - i - 1];
          s.pop();
        } else {
          seq[n - i - 1] = -p[n - i - 1];
          s.push(p[n - i - 1]);
        }
      }
    }
  }
  if (!s.empty()) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
    for (int i = 0; i < n; ++i) cout << seq[i] << " ";
    cout << '\n';
  }
  return 0;
}
