#include <bits/stdc++.h>
using namespace std;
int in[1000005];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &in[i]);
  int q, a;
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) {
    scanf("%d", &a);
    in[a] *= -1;
  }
  stack<int> S;
  for (int i = n; i >= 1; i--) {
    if (S.empty()) {
      if (in[i] > 0) in[i] *= -1;
      S.push(in[i]);
    } else {
      if (in[i] < 0) {
        S.push(in[i]);
      } else {
        if (S.top() == -in[i]) {
          S.pop();
        } else {
          in[i] *= -1;
          S.push(in[i]);
        }
      }
    }
  }
  if (S.empty()) {
    printf("YES\n");
    for (int i = 1; i <= n; i++) printf("%d ", in[i]);
    printf("\n");
  } else {
    printf("NO\n");
  }
  return 0;
}
