#include <bits/stdc++.h>
using namespace std;
int p[1000005];
int main() {
  int n, t, k, i;
  bool yes = 1;
  long long sum = 0;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> p[i], sum += p[i];
  cin >> t;
  for (i = 0; i < t; i++) {
    cin >> k;
    p[k] = -p[k];
  }
  stack<int> q;
  if (sum % 2 != 0)
    yes = 0;
  else {
    for (i = n; i >= 1; i--) {
      if (i != n && p[i] > 0 && !q.empty()) {
        int m = q.top();
        if (p[m] == (-p[i])) {
          q.pop();
          continue;
        }
        if (p[m] == p[i]) {
          p[m] = -p[m], q.pop();
          continue;
        }
      }
      q.push(i);
    }
  }
  if (yes && q.empty()) {
    cout << "YES" << endl;
    for (i = 1; i < n; i++) cout << p[i] << " ";
    cout << p[n] << endl;
  } else
    cout << "NO" << endl;
  return 0;
}
