#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n + 1];
  for (int i = 0; i < n; i++) cin >> a[i];
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) {
    int temp;
    cin >> temp;
    a[temp - 1] = -a[temp - 1];
  }
  stack<pair<int, int> > s;
  for (int i = n - 1; i >= 0; i--) {
    if (s.empty()) {
      s.push(make_pair(a[i], i));
      continue;
    }
    if (s.top().first == -a[i] && a[i] > 0) {
      s.pop();
      continue;
    }
    if (s.top().first == a[i] && a[i] > 0) {
      a[s.top().second] = -a[s.top().second];
      s.pop();
      continue;
    }
    s.push(make_pair(a[i], i));
  }
  if (s.empty())
    cout << "YES" << endl;
  else {
    cout << "NO" << endl;
    return 0;
  }
  for (int i = 0; i < n; i++) cout << a[i] << " ";
  cout << endl;
  return 0;
}
