#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline string tostring(const T& x) {
  ostringstream os;
  os << x;
  return os.str();
}
inline int toint(const string& s) {
  istringstream is(s);
  int x;
  is >> x;
  return x;
}
inline int todecimal(string s) {
  int a = 0;
  for (int i = 0; i < s.size(); i++) a = 2 * a + (s[i] - '0');
  return a;
}
inline string tobinary(int a) {
  string s;
  while (a != 0) {
    s = (char)(a % 2 + '0') + s;
    a >>= 1;
  }
  return s;
}
template <typename T>
inline T sqr(T x) {
  return x * x;
}
template <typename T>
T gcd(T a, T b) {
  return (b == 0) ? abs(a) : gcd(b, a % b);
}
inline int isvowel(char c) {
  if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') return 1;
  return 0;
}
inline int isprime(int a) {
  for (int i = 2; i * i <= a; i++)
    if (!(a % i)) return 0;
  return 1;
}
inline void inp(int& n) {
  n = 0;
  int ch = getchar();
  int sign = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') sign = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    n = (n << 3) + (n << 1) + ch - '0', ch = getchar();
  n = n * sign;
}
int n;
const int maxn = 1000000;
int a[maxn];
int st[maxn];
void solve() {
  int pt = 0;
  for (int i = n - 1; i >= 0; i--) {
    if (a[i] < 0) {
      st[pt++] = a[i];
    } else {
      if (pt != 0 && st[pt - 1] == -a[i])
        pt--;
      else
        st[pt++] = (a[i] *= -1);
    }
  }
  if (pt)
    cout << "NO\n";
  else {
    cout << "YES\n";
    for (int i = 0; i < n; i++) cout << a[i] << " ";
    cout << endl;
  }
}
void input() {
  inp(n);
  for (int i = 0; i < n; i++) inp(a[i]);
  int m;
  inp(m);
  for (int i = 0; i < m; i++) {
    int index;
    inp(index);
    a[index - 1] *= -1;
  }
}
int main() {
  int testcase = 1;
  for (int i = 0; i < testcase; i++) {
    input();
    solve();
  }
  return 0;
}
