#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:200000000")
using namespace std;
template <typename T>
inline T Abs(T x) {
  return (x >= 0) ? x : -x;
}
template <typename T>
inline T sqr(T x) {
  return x * x;
}
template <typename T>
string toStr(T x) {
  stringstream st;
  st << x;
  string s;
  st >> s;
  return s;
}
inline int nextInt() {
  int x;
  if (scanf("%d", &x) != 1) throw;
  return x;
}
inline long long nextInt64() {
  long long x;
  if (scanf("%I64d", &x) != 1) throw;
  return x;
}
inline double nextDouble() {
  double x;
  if (scanf("%lf", &x) != 1) throw;
  return x;
}
const int INF = (int)1E9;
const long long INF64 = (long long)1E18;
const long double EPS = 1E-9;
const long double PI = 3.1415926535897932384626433832795;
const int MAXN = 1000100;
int n, m, a[MAXN], t[MAXN];
bool used[MAXN];
int main() {
  n = nextInt();
  for (int i = 0; i < (int)(n); i++) a[i] = -nextInt();
  m = nextInt();
  for (int i = 0; i < (int)(m); i++) {
    t[i] = nextInt() - 1;
    used[t[i]] = true;
  }
  vector<int> st;
  for (int i = (int)(n)-1; i >= 0; i--)
    if (used[i] || st.empty() || st.back() != a[i])
      st.push_back(a[i]);
    else {
      st.pop_back();
      a[i] *= -1;
    }
  if (!st.empty()) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  for (int i = 0; i < (int)(n); i++) printf("%d ", a[i]);
  return 0;
}
