#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, t;
  cin >> n;
  vector<int> d(n);
  for (int i = 0; i < (int)(n); ++i) cin >> d[i];
  cin >> m;
  for (int i = 0; i < (int)(m); ++i) {
    cin >> t;
    d[t - 1] *= -1;
  }
  vector<int> res(n);
  stack<int> s;
  for (int i = (int)((n)-1); i >= 0; --i) {
    if (d[i] > 0 && s.size() > 0 && s.top() == d[i]) {
      s.pop();
      res[i] = d[i];
    } else {
      s.push(abs(d[i]));
      res[i] = -1 * abs(d[i]);
    }
  }
  if (s.empty()) {
    cout << "YES" << endl;
    for (int i = 0; i < (int)(n); ++i) {
      cout << res[i] << " ";
    }
    cout << endl;
  } else {
    cout << "NO" << endl;
  }
}
