#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)

int lob(const auto& v, auto x) { return lower_bound(ALL(v),x)-v.begin(); }
bool chmax(auto& a, auto b) { return a<b ? a=b, true : false; }
bool chmin(auto& a, auto b) { return a>b ? a=b, true : false; }
using ll=long long; const int INF=1e9+10; const ll INFL=4e18;
using VI=vector<int>; using VVI=vector<VI>; using VL=vector<ll>; using VVL=vector<VL>;
using PL=pair<ll,ll>; using VP=vector<PL>; using WG=vector<vector<pair<int,ll>>>;

#ifdef LOCAL
#include "./debug.hpp"
#else
#define debug(...)
#define print_line
#endif


//----------------------------------------------------------

void solve() {
    int N,M; cin>>N>>M;
    VI A(N); REP(i,N) cin>>A[i];
    VVI G(N);
    REP(i,M) {
        int u,v; cin>>u>>v; u--; v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    REP(b,1<<N) {
        VI B(N);
        REP(i,N) if(b>>i&1) B[i]=1;
        VI C(N);
        REP(i,N) for(int j: G[i]) if(B[j]) C[i]++;
        if(A==C) {
            cout<<"Yes"<<endl;
            REP(i,N) cout<<B[i]<<' '; cout<<endl;
            return;
        }
    }

    cout<<"No"<<endl;
    return;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    //cout<<fixed<<setprecision(15);
    int T=1; //cin>>T;
    while(T--) solve();
}