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