n,m=map(int,input().split())
A=[*map(int,input().split())]
g=[0]*n
for i in range(m):
    a,b=map(int,input().split())
    g[a-1]|=1<<b-1;g[b-1]|=1<<a-1
for i in range(1<<n):
    if all((i&g[j]).bit_count()==A[j]for j in range(n)):exit(print("Yes")or print(*f"{i:0{n}b}"[::-1]))
print("No")