#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  std::cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
template <typename T, typename U>
static inline void amin(T& x, U y) {
  if (y < x) x = y;
}
template <typename T, typename U>
static inline void amax(T& x, U y) {
  if (x < y) x = y;
}
int max(int a, int b) { return (a > b) ? a : b; }
int min(int a, int b) { return (a < b) ? a : b; }
int solve() {
  int n;
  cin >> n;
  if (n % 2) return cout << "NO" << '\n', 0;
  int a[n];
  unordered_map<int, int> cnt;
  for (int i = 0; i < n; ++i) cin >> a[i];
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) {
    int x;
    cin >> x;
    x--;
    if (cnt[a[x]] < 0) return cout << "NO", 0;
    a[x] *= -1;
  }
  for (int i = 0; i < n; i++)
    if (a[i] > 0)
      cnt[a[i]]++;
    else
      cnt[-a[i]]--;
  stack<pair<int, int> > st;
  for (int i = n - 1; i >= 0; i--) {
    if (st.size()) {
      if (st.top().first == -a[i] && a[i] > 0) {
        st.pop();
        continue;
      }
      if (st.top().first == a[i]) {
        if (a[i] > 0 && cnt[a[i]] > 0) {
          cnt[a[i]] -= 2;
          a[st.top().second] *= -1;
          st.pop();
          continue;
        }
      }
      st.push({a[i], i});
    } else
      st.push({a[i], i});
  }
  if (st.size())
    cout << "NO";
  else {
    cout << "YES" << '\n';
    for (int i = 0; i < n; i++) cout << a[i] << " ";
  }
  return 0;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
