#include<bits/stdc++.h>
#if __has_include(<atcoder/all>)
#endif
using namespace std;
#define eb emplace_back
#define done(...) return pp(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define RDVL(T,n,...) vec<T>__VA_ARGS__;fe(refs(__VA_ARGS__),e)e.get().resizes(n);lin(__VA_ARGS__)
#define RDVV(T,n,...) vec<T>__VA_ARGS__;fe(refs(__VA_ARGS__),e)e.get().resizes(n);vin(__VA_ARGS__)
#define VL(n,...) RDVL(ll,n,__VA_ARGS__)
#define VV(n,...) RDVV(ll,n,__VA_ARGS__)
#define fo(i,...) for(auto[i,i##stop,i##step]=for_range<ll>(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fe(a,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):a)
#define maybe(p,c) (p?c:remove_cvref_t<decltype(c)>{})
#define defpp template<ostream&o=cout>void pp(const auto&...a){[[maybe_unused]]const char*c="";((o<<c<<a,c=" "),...);o<<'\n';}void epp(const auto&...a){pp<cerr>(a...);}
#define entry defpp void main();void main2();}int main(){my::io();my::main();}namespace my{
namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto refs(auto&...a){return array{ref(a)...};}
template<class T>constexpr auto for_range(T s,T b){T a=0;if(s)swap(a,b);return array{a-s,b,1-s*2};}
const string newline{char(10)};
const string space{char(32)};
void lin(auto&...a){(cin>>...>>a);}
void vin(auto&...a){fo(i,(a.size()&...))(cin>>...>>a[i]);}
auto Yes(bool p=1){return p?"Yes":"No";}
auto No(){return Yes(0);}
void ppYes(bool p=1){cout<<Yes(p)<<newline;}
template<class T=ll>T pow2(ll n){return T(1)<<n;}
constexpr auto at2(auto x,auto i){return x>>i&1;}
void dec(auto&...a){((--a),...);}
template<class...A>using pack_back_t=tuple_element_t<sizeof...(A)-1,tuple<A...>>;
}
namespace my{
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class T>ostream&operator<<(ostream&o,const vector<T>&v){ll n=v.size();fo(i,n)o<<v[i]<<maybe(i<n-1,space);return o;}
template<class V>constexpr int depth=0;
template<class T>struct core_t_helper{using type=T;};
template<class T>using core_t=core_t_helper<T>::type;
template<class V>struct vec;
template<int D,class T>struct hvec_helper{using type=vec<typename hvec_helper<D-1,T>::type>;};
template<class T>struct hvec_helper<0,T>{using type=T;};
template<int D,class T>using hvec=hvec_helper<D,T>::type;
template<class V>struct vec:vector<V>{
  static constexpr int D=depth<V>+1;
  using C=core_t<V>;
  using vector<V>::vector;
  void resizes(const auto&...a){if constexpr(sizeof...(a)==D)*this=make(a...,C{});else{ }}
  static auto make(ll n,const auto&...a){
    if constexpr(sizeof...(a)==1)return vec<C>(n,array{a...}[0]);
    else { }
  }
  vec&operator--(){fe(*this,e)--e;return*this;}
  ll size()const{return vector<V>::size();}
  auto&emplace_back(auto&&...a){vector<V>::emplace_back(std::forward<decltype(a)>(a)...);return*this;}
};
template<class...A>requires(sizeof...(A)>=2)vec(const A&...a)->vec<hvec<sizeof...(A)-2,pack_back_t<A...>>>;
}
namespace my{
template<class WT>struct Edge{
  int from_,to_;
  WT wt_;
  int id_;
  Edge()=default;
  Edge(int from,int to,WT wt=1,int id=-1):from_(from),to_(to),wt_(wt),id_(id){}
};
template<class WT>class Graph{
public:
  vec<vec<Edge<WT>>>edges_;
  Graph()=default;
  Graph(ll n):edges_(n){}
  decltype(auto)operator[](ll i){return edges_[i];}
  auto&add_edges(const vec<ll>&a,const vec<ll>&b){fo(i,a.size())edges_[a[i]].eb(a[i],b[i],1,i);return*this;}
};
}
namespace my{entry
void main(){
  LL(N,M);
  VL(N,a);
  VV(M,u,v);dec(u,v);
  Graph<ll>g(N);
  g.add_edges(u,v).add_edges(v,u);

  fo(S,pow2(N)){
    vec<ll>cnt(N);
    fo(i,N)fe(g[i],e)cnt[i]+=at2(S,e.to_);
    if(cnt==a){
      ppYes();
      vec<ll>res(N);
      fo(i,N)res[i]=at2(S,i);
      done(res);
    }
  }
  pp(No());
}}