#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  int n;
  int t;
  vector<int> p;
  cin >> n;
  if (n % 2 != 0) {
    cout << "NO" << endl;
    return 0;
  }
  for (int i = 0; i < n; i++) {
    int z;
    cin >> z;
    p.push_back(z);
  }
  cin >> t;
  for (int i = 0; i < t; i++) {
    int z;
    cin >> z;
    z--;
    p[z] = -p[z];
  }
  vector<int> pos_loc;
  vector<int> sat;
  for (int i = 0; i < n; i++) {
    if (p[i] > 0) {
      pos_loc.push_back(i);
    } else {
      sat.push_back(-p[i]);
      for (int rj = pos_loc.size() - 1; rj >= 0 && sat.size() > 0; rj--) {
        int j = pos_loc[rj];
        if (p[j] != sat[sat.size() - 1]) {
          p[j] = -p[j];
          pos_loc.pop_back();
          sat.push_back(-p[j]);
        } else {
          sat.pop_back();
          pos_loc.pop_back();
        }
      }
      if (sat.size() > 0) {
        cout << "NO" << endl;
        return 0;
      }
      sat.clear();
    }
  }
  while (pos_loc.size() > 0) {
    int i = pos_loc[pos_loc.size() - 1];
    pos_loc.pop_back();
    p[i] = -p[i];
    sat.push_back(-p[i]);
    for (int rj = pos_loc.size() - 1; rj >= 0 && sat.size() > 0; rj--) {
      int j = pos_loc[rj];
      if (p[j] != sat[sat.size() - 1]) {
        p[j] = -p[j];
        pos_loc.pop_back();
        sat.push_back(-p[j]);
      } else {
        sat.pop_back();
        pos_loc.pop_back();
      }
    }
    if (sat.size() > 0) {
      cout << "NO" << endl;
      return 0;
    }
    sat.clear();
  }
  cout << "YES" << endl;
  for (int i = 0; i < n; i++) {
    cout << p[i] << (i == n - 1 ? "\n" : " ");
  }
  return 0;
}
