#include <bits/stdc++.h>
using namespace std;
int chk[1000010];
int inp[1000010];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    scanf("%d", &inp[i]);
  }
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) {
    int x;
    scanf("%d", &x);
    x--;
    chk[x] = 1;
  }
  stack<int> st;
  for (int i = n - 1; i >= 0; i--) {
    if (st.empty()) {
      st.push(inp[i]);
      inp[i] = -inp[i];
    } else if (st.top() != inp[i]) {
      st.push(inp[i]);
      inp[i] = -inp[i];
    } else {
      if (chk[i] != 1) {
        st.pop();
      } else {
        st.push(inp[i]);
        inp[i] = -inp[i];
      }
    }
  }
  if (!st.empty())
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) printf("%d ", inp[i]);
  }
}
