Problem: You are given a connected undirected graph with n vertices and m edges. The vertices are enumerated from 1 to n. 

You are given n integers c1, c2, ..., cn, each of them is between  - n and n, inclusive. It is also guaranteed that the parity of cv equals the parity of degree of vertex v. The degree of a vertex is the number of edges connected to it.

You are to write a weight between  - 2·n2 and 2·n2 (inclusive) on each edge in such a way, that for each vertex v the sum of weights on edges connected to this vertex is equal to cv, or determine that this is impossible.

Input

The first line contains two integers n and m (2 ≤ n ≤ 105, n - 1 ≤ m ≤ 105) — the number of vertices and the number of edges.

The next line contains n integers c1, c2, ..., cn ( - n ≤ ci ≤ n), where ci is the required sum of weights of edges connected to vertex i. It is guaranteed that the parity of ci equals the parity of degree of vertex i.

The next m lines describe edges of the graph. The i-th of these lines contains two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi), meaning that the i-th edge connects vertices ai and bi.

It is guaranteed that the given graph is connected and does not contain loops and multiple edges.

Output

If there is no solution, print "NO".

Otherwise print "YES" and then m lines, the i-th of them is the weight of the i-th edge wi ( - 2·n2 ≤ wi ≤ 2·n2).

Examples

Input

3 3
2 2 2
1 2
2 3
1 3


Output

YES
1
1
1


Input

4 3
-1 0 2 1
1 2
2 3
3 4


Output

YES
-1
1
1


Input

6 6
3 5 5 5 1 5
1 4
3 2
4 3
4 5
3 5
5 6


Output

YES
3
5
3
-1
-3
5


Input

4 4
4 4 2 4
1 2
2 3
3 4
4 1


Output

NO

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100011;
int pre[maxn << 1], son[maxn << 1], v[maxn << 1], now[maxn], tot;
void add(int a, int b, int c) {
  pre[++tot] = now[a];
  now[a] = tot;
  son[tot] = b;
  v[tot] = c;
}
void cc(int a, int b, int c) {
  add(a, b, c);
  add(b, a, c);
}
struct Te {
  int a, b;
  long long ans;
} e[maxn];
int n, m;
long long a[maxn];
void init() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%lld", a + i);
  for (int i = 1; i <= m; ++i) scanf("%d%d", &e[i].a, &e[i].b), e[i].ans = 0;
}
int fa[maxn], dep[maxn];
long long V[maxn];
inline int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
void dfs(int x, int fa) {
  for (int p = now[x]; p; p = pre[p])
    if (son[p] != fa)
      V[son[p]] = a[son[p]], dep[son[p]] = dep[x] + 1, dfs(son[p], x),
      V[x] -= V[son[p]];
}
void work() {
  for (int i = 1; i <= n; ++i) fa[i] = i;
  for (int i = 1; i <= m; ++i) {
    if (find(e[i].a) != find(e[i].b)) {
      cc(e[i].a, e[i].b, i);
      fa[find(e[i].a)] = find(e[i].b);
    }
  }
  V[1] = a[1];
  dep[1] = 1;
  dfs(1, 0);
  if (V[1] & 1) return puts("NO"), void();
  bool ok = !V[1];
  if (!ok)
    for (int i = 1; i <= m; ++i)
      if ((dep[e[i].a] + dep[e[i].b]) % 2 == 0) {
        e[i].ans = ((dep[e[i].a] & 1) ? 1 : -1) * V[1] / 2;
        ok = 1;
        a[e[i].a] -= e[i].ans;
        a[e[i].b] -= e[i].ans;
        break;
      }
  if (!ok) return puts("NO"), void();
  V[1] = a[1];
  dfs(1, 0);
  for (int i = 1; i <= n; ++i)
    for (int p = now[i]; p; p = pre[p])
      if (dep[son[p]] > dep[i]) e[v[p]].ans = V[son[p]];
  puts("YES");
  for (int i = 1; i <= m; ++i) printf("%lld\n", e[i].ans);
}
int main() {
  init();
  work();
  return 0;
}