#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pli;
const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

int a[20][20];

int main() {
    cin >> n >> m;
    for (int i = 1; i < n + 1; i++) cin >> w[i];
    for (int i = 1, c, b; i < m + 1; i++) {
        cin >> c >> b;
        a[c][b] = a[b][c] = 1;
    }
    for (int i = 0; i < (1 << n); i++) {
        for (int j = 1; j < n + 1; j++) {
            int c = 0;
            for (int k = 1; k < n + 1; k++) c += a[j][k] && (i >> (k - 1) & 1);
            if (c != w[j]) goto NE;
        }
        puts("Yes");
        for (int j = 0; j < n; j++) printf("%d ", i >> j & 1);
        return 0;
        NE:;
    }
    puts("No");
    return 0;
}