#include <bits/stdc++.h>
using namespace std;
int x[1000001], stk[1000001], top = -1;
int main() {
  int n, m = 0, i, t, q;
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d", &x[i]);
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &q);
    x[q - 1] *= -1;
    m++;
  }
  if (n % 2 || m > n / 2)
    printf("NO\n");
  else {
    for (i = n - 1; i >= 0; i--) {
      stk[++top] = i;
      if (top > 0 && abs(x[stk[top]]) == abs(x[stk[top - 1]]) &&
          x[stk[top]] > 0) {
        x[stk[top - 1]] = -abs(x[stk[top - 1]]);
        top -= 2;
      }
    }
    if (top > -1)
      printf("NO\n");
    else {
      printf("YES\n");
      for (i = 0; i < n - 1; i++) printf("%d ", x[i]);
      printf("%d\n", x[i]);
    }
  }
  return 0;
}
