#include <bits/stdc++.h>
using namespace std;
int N, top;
int s[1002013], t[1002013], sck[1002013];
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; ++i) scanf("%d", s + i);
  int q;
  scanf("%d", &q);
  for (int i = 1; i <= q; ++i) {
    int x;
    scanf("%d", &x);
    t[x] = 1;
  }
  for (int i = N; i >= 1; --i) {
    if (t[i] || !top || sck[top] != s[i]) {
      sck[++top] = s[i];
      s[i] = -s[i];
    } else
      --top;
  }
  if (top)
    puts("NO");
  else {
    puts("YES");
    for (int i = 1; i <= N; ++i) printf("%d ", s[i]);
  }
  return 0;
}
