#include <bits/stdc++.h>
using namespace std;
int p[1000100];
int st[1000100];
int main() {
  int n, m;
  cin >> n;
  for (int _n(n), i(0); i < _n; i++) cin >> p[i];
  cin >> m;
  for (int _n(m), i(0); i < _n; i++) {
    int j;
    cin >> j;
    p[j - 1] *= -1;
  }
  reverse(p, p + n);
  int sz = 0;
  for (int _n(n), i(0); i < _n; i++) {
    int v = p[i];
    if (v > 0 && (sz == 0 || st[sz - 1] != v)) v = -v;
    p[i] = v;
    if (v > 0)
      sz--;
    else
      st[sz++] = -v;
  }
  assert(sz >= 0);
  if (sz > 0) {
    cout << "NO\n";
  } else {
    reverse(p, p + n);
    cout << "YES\n";
    for (int _n(n), i(0); i < _n; i++) cout << p[i] << " ";
    cout << endl;
  }
  return 0;
}
