#include <bits/stdc++.h>
using namespace std;
int n, m, a[1000100], q[1000100];
int main() {
  cin >> n;
  int i;
  for (i = 0; i < n; i++) scanf("%d", &a[i]);
  cin >> m;
  while (m--) {
    int x;
    scanf("%d", &x);
    a[x - 1] = -a[x - 1];
  }
  int tot = 0;
  for (i = n - 1; i >= 0; i--) {
    if (tot == 0 || a[i] + q[tot] != 0) {
      if (a[i] > 0) a[i] = -a[i];
      q[++tot] = a[i];
    } else
      tot--;
  }
  if (tot == 0) {
    cout << "YES" << endl;
    for (i = 0; i < n - 1; i++) printf("%d ", a[i]);
    cout << a[n - 1] << endl;
  } else
    cout << "NO" << endl;
}
