2 1
1 1
2 1
 8 12
-6 2 -3 2 6 -7 1 -5
2 1
5 6
1 6
1 4
8 2
2 7
2 5
8 3
8 4
3 7
7 6
3 1
 10 13
3 4 -3 8 6 4 -5 1 3 -7
9 5
9 2
10 3
1 4
3 5
9 1
6 10
10 4
3 1
2 7
1 6
1 7
7 8
 43 52
-23 -18 -35 21 -12 38 -35 -11 28 -20 27 -5 9 -19 -39 -25 -32 32 -36 28 11 37 1 -25 -22 9 -15 21 25 -39 10 36 -30 -40 22 26 25 -27 -22 -38 -1 18 -13
33 40
31 23
30 26
21 17
6 2
41 19
32 39
32 23
13 14
25 35
31 30
19 32
25 22
34 36
7 40
23 6
40 12
1 3
23 43
36 13
18 33
17 32
7 3
21 34
41 35
20 7
23 1
41 8
25 19
20 29
42 5
40 21
9 37
17 41
30 10
41 18
39 1
20 24
20 4
42 3
20 25
5 16
31 9
42 28
10 11
19 42
31 38
25 2
31 27
17 25
13 15
31 20
 2 1
1 1
1 2
 5 7
4 1 5 3 -1
2 4
5 4
5 2
1 5
1 2
4 1
1 3
 10 12
5 1 1 8 -8 10 -3 -2 1 7
5 3
8 2
10 9
4 6
5 6
4 5
5 10
4 7
8 4
3 1
3 6
6 10
 20 40
-9 -10 -9 15 -3 -5 -17 -10 -6 2 -13 19 10 -15 15 -14 17 0 7 -8
3 17
6 18
15 12
2 5
18 3
16 20
6 17
20 10
10 18
9 12
15 3
6 4
15 16
20 6
20 9
9 4
4 8
14 5
11 7
12 11
3 13
14 19
7 17
16 14
19 7
12 13
14 13
13 11
9 14
13 17
8 19
5 20
2 17
2 16
12 5
8 1
20 3
6 2
5 18
13 8

YES
                                                               1
 NO
 YES
                                                              -7
                                                              10
                                                             -16
                                                               3
                                                              13
                                                               0
                                                               4
                                                               5
                                                               0
                                                              -6
                                                               0
                                                               0
                                                               1
 NO
 YES
                                                               1
 YES
                                                               2
                                                               1
                                                              -1
                                                              -1
                                                               0
                                                               0
                                                               5
 YES
-4
1
1
17
-7
-3
6
-3
-3
5
0
0
 YES
                                                             -30
                                                             -21
                                                             -23
                                                             -10
                                                              21
                                                             -52
                                                               0
                                                               2
                                                               0
                                                              -9
                                                               0
                                                              16
                                                              38
                                                               0
                                                              42
                                                               0
                                                              -1
                                                               7
                                                             -64
                                                              51
                                                               0
                                                               7
                                                              47
                                                               0
                                                               0
                                                               0
                                                              10
                                                               0
                                                             -39
                                                               0
                                                               0
                                                               0
                                                               0
                                                               0
                                                               0
                                                              -9
                                                               0
                                                               0
                                                               0
                                                               0

#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
const int LG = 20;
int n, m;
long long a[maxn];
int visited[maxn];
long long weight[maxn];
vector<pair<int, int>> g[maxn];
vector<int> odd, even;
long long sumodd, sumeven;
int depth[maxn];
int parEdge[maxn];
int jump[maxn][LG];
vector<int> oddcycle;
pair<int, int> edges[maxn];
void dfs_prepare(int v, int color) {
  if (!v) {
    fill(visited, visited + maxn, -1);
  }
  visited[v] = color;
  if (color) {
    sumodd += a[v];
    odd.emplace_back(v);
  } else {
    sumeven += a[v];
    even.emplace_back(v);
  }
  for (auto &e : g[v]) {
    if (visited[e.first] != -1) {
      if (visited[e.first] != visited[v] || oddcycle.size() > 0) continue;
      oddcycle.emplace_back(color);
      oddcycle.emplace_back(e.second);
      for (int x = v; x != e.first; x = jump[x][0]) {
        oddcycle.emplace_back(parEdge[x]);
      }
      continue;
    }
    int s = e.first;
    parEdge[s] = e.second;
    jump[s][0] = v;
    depth[s] = depth[v] + 1;
    for (int j = 1; j < LG; ++j) jump[s][j] = jump[jump[s][j - 1]][j - 1];
    dfs_prepare(s, 1 - color);
  }
}
int LCA(int u, int v) {
  if (depth[u] < depth[v]) swap(u, v);
  for (int j = LG - 1; j >= 0; --j) {
    if (depth[jump[u][j]] >= depth[v]) u = jump[u][j];
  }
  if (u == v) return v;
  for (int j = LG - 1; j >= 0; --j) {
    if (jump[u][j] != jump[v][j]) {
      u = jump[u][j];
      v = jump[v][j];
    }
  }
  return jump[v][0];
}
long long fs[maxn];
int same(int x, int y) { return x / abs(x) == y / abs(y); }
void upd(int x, int w, int sign = 1) {
  if (a[x] < 0) {
    a[x] += w;
    fs[x] += sign * w;
  } else {
    a[x] -= w;
    fs[x] -= sign * w;
  }
}
void normalize(vector<int> ids) {
  vector<int> stac;
  for (int x : ids) {
    if (a[x] == 0) continue;
    if (stac.empty() || same(a[x], a[stac.back()])) {
      stac.push_back(x);
    } else {
      while (abs(a[x]) > 0) {
        if (stac.empty()) break;
        int y = stac.back();
        int w = min(abs(a[x]), abs(a[y]));
        upd(x, w);
        upd(y, w);
        if (a[y] == 0) stac.pop_back();
      }
      if (abs(a[x]) > 0) stac.push_back(x);
    }
  }
}
void dfs_solve(int v) {
  if (!v) {
    fill(visited, visited + maxn, -1);
  }
  visited[v] = 1;
  for (auto &e : g[v]) {
    int s = e.first, w = e.second;
    if (visited[s] != -1) continue;
    dfs_solve(s);
    weight[w] += fs[s];
    fs[v] -= fs[s];
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (int i = 0; i < m; ++i) {
    int u, v;
    cin >> u >> v;
    g[--u].emplace_back(--v, i);
    g[v].emplace_back(u, i);
    weight[i]++;
    a[v]++;
    a[u]++;
    edges[i] = make_pair(u, v);
  }
  dfs_prepare(0, 0);
  if (sumodd != sumeven) {
    if (oddcycle.empty()) {
      cout << "NO" << endl;
      return 0;
    }
    long long need = sumodd - sumeven;
    need /= 2;
    int sign = 1;
    if (oddcycle.front() == 0) sign *= -1;
    for (int i = 1; i < oddcycle.size(); ++i) {
      auto [u, v] = edges[oddcycle[i]];
      a[v] -= sign * need;
      a[u] -= sign * need;
      weight[oddcycle[i]] -= sign * need;
      sign *= -1;
    }
  }
  normalize(even);
  normalize(odd);
  for (int i = 0, j = 0;;) {
    if (i == even.size() || j == odd.size()) break;
    if (a[even[i]] == 0) {
      ++i;
      continue;
    }
    if (a[odd[j]] == 0) {
      ++j;
      continue;
    }
    int x = even[i], y = odd[j];
    int w = min(abs(a[x]), abs(a[y]));
    upd(x, w);
    upd(y, w);
  }
  dfs_solve(0);
  cout << "YES\n";
  for (int i = 0; i < m; ++i) cout << -weight[i] << "\n";
  return 0;
}
