/* -*- coding: utf-8 -*-
 *
 * 3275.cc:  No.3275 Minesweeper on Graph - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 16;

/* typedef */

using vi = vector<int>;

/* global variables */

int as[MAX_N];
vi nbrs[MAX_N];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", as + i);
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    nbrs[u].push_back(v);
    nbrs[v].push_back(u);
  }

  int nbits = 1 << n;
  for (int bits = 0; bits < nbits; bits++) {
    bool ok = true;
    for (int u = 0; ok && u < n; u++) {
      int sum = 0;
      for (auto v: nbrs[u]) sum += ((bits >> v) & 1);
      ok = (sum == as[u]);
    }

    if (ok) {
      puts("Yes");
      for (int i = 0; i < n; i++)
	printf("%d%c", (bits >> i) & 1, (i + 1 < n) ? ' ' : '\n');
      return 0;
    }
  }
  
  puts("No");
  
  return 0;
}