import pulp

N, M = map(int, input().split())
A = list(map(int, input().split()))

graph = [[] for _ in range(N)]
for _ in range(M):
    x, y = map(int, input().split())
    graph[x-1].append(y-1)
    graph[y-1].append(x-1)

problem = pulp.LpProblem(sense=pulp.LpMaximize)
X = [pulp.LpVariable(name=f'x_{i}', cat=pulp.LpBinary) for i in range(N)]

problem += sum(X)

for u in range(N):
    problem += sum(X[v] for v in graph[u]) == A[u]

problem.solve(pulp.PULP_CBC_CMD(msg=False))

ans = [int(pulp.value(x)) for x in X]

check = [0] * N

for u, x in enumerate(ans):
    if x < 0 or 1 < x:
        print("No")
        exit()
    
    for v in graph[u]:
        check[v] += x

if A == check:
    print("Yes")
    print(*ans)
else:
    print("No")