#include <bits/stdc++.h>
using namespace std;
int a[1000003];
int qstack[1000003], top = 0;
int main() {
  int n, t, tmp, i;
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d", a + i);
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &tmp);
    a[tmp - 1] *= -1;
  }
  for (i = n - 1; i >= 0; i--)
    if (a[i] < 0)
      qstack[top++] = a[i];
    else {
      if (a[i] == -qstack[top - 1])
        top--;
      else {
        a[i] *= -1;
        qstack[top++] = a[i];
      }
    }
  if (top == 0) {
    printf("YES\n");
    for (i = 0; i < n; i++) printf("%d%c", a[i], i == n - 1 ? '\n' : ' ');
  } else
    printf("NO\n");
  return 0;
}
