#include <bits/stdc++.h>
using namespace std;
const int N = 1000000 + 100;
int n, m;
int a[N], p[N];
bool neg[N];
int main() {
  cin >> n;
  for (int i = (1); i <= (n); i++) scanf("%d", a + n - i + 1);
  int cnt = 0;
  cin >> cnt;
  while (cnt--) {
    int x;
    scanf("%d", &x);
    neg[n - x + 1] = 1;
  }
  for (int i = (1); i <= (n); i++)
    if (m && a[p[m]] == a[i] && !neg[i]) {
      a[p[m]] = -a[p[m]];
      m--;
    } else {
      p[++m] = i;
    }
  if (m == 0) {
    puts("YES");
    for (int i = (n); i >= (1); i--) cout << a[i] << " ";
    cout << endl;
  } else
    puts("NO");
  return 0;
}
