#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long)1e18;
const int mod = (int)1e9 + 7;
const int MAXN = (int)1e6 + 5;
long long n;
int p[MAXN], q[MAXN], kap[MAXN];
unordered_map<int, int> mp;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> p[i];
  }
  int t;
  cin >> t;
  if (t > n / 2 || n % 2) {
    cout << "NO" << '\n';
    return 0;
  }
  for (int j = 0; j < t; j++) {
    cin >> q[j];
    q[j]--;
    kap[q[j]] = 1;
  }
  bool tru = 1;
  stack<int> st;
  for (int i = n - 1; i >= 0; i--) {
    if (mp[p[i]] == 0 || kap[i] || st.empty() || st.top() != p[i]) {
      kap[i] = 1;
      mp[p[i]]++;
      st.push(p[i]);
    } else {
      mp[p[i]]--;
      st.pop();
    }
  }
  if (!st.empty()) tru = 0;
  for (int i = 0; i < n; i++) {
    int cur = p[i];
    if (kap[i]) {
      if (st.empty() || st.top() != cur) {
        tru = 0;
        break;
      }
      st.pop();
    } else {
      st.push(p[i]);
    }
  }
  if (!st.empty()) tru = 0;
  if (!tru) {
    cout << "NO" << '\n';
  } else {
    cout << "YES" << '\n';
    for (int i = 0; i < n; i++) cout << (kap[i] ? "-" : "") << p[i] << " ";
    cout << '\n';
  }
}
