#include <bits/stdc++.h>
using namespace std;
int a[1000005], n, t, d;
stack<int> s;
int main() {
  scanf("%d", &n);
  if (n % 2) {
    cout << "NO" << endl;
    return 0;
  }
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  reverse(a + 1, a + n + 1);
  scanf("%d", &t);
  for (int i = 1; i <= t; i++)
    scanf("%d", &d), a[n - d + 1] = -abs(a[n - d + 1]);
  for (int i = 1; i <= n; i++) {
    if (a[i] < 0)
      s.push(i);
    else if (a[i] > 0 && !s.empty() && a[s.top()] + a[i] == 0) {
      s.pop();
    } else if (a[i] > 0 && !s.empty() && a[s.top()] == a[i]) {
      a[s.top()] = -a[s.top()];
      s.pop();
    } else if (a[i] > 0)
      s.push(i);
  }
  if (!s.empty())
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    for (int i = n; i >= 1; i--) printf("%d%c", a[i], i > 1 ? ' ' : '\n');
  }
  return 0;
}
