#include <bits/stdc++.h>
using namespace std;
int n, m, n1, n2, n3, bicolor[5000 + 3], ccIndex[5000 + 3], numCC,
    cntColor[5000 + 3][2], ans[5000 + 3];
vector<int> adj[5000 + 3];
bool dp[5000 + 3][5000 + 3], sol[5000 + 3][5000 + 3];
bool checkBipartite(int u, int currentColor) {
  bicolor[u] = currentColor;
  cntColor[numCC][currentColor] += 1;
  ccIndex[u] = numCC;
  bool bipartite = true;
  for (auto v : adj[u]) {
    if (bicolor[v] == -1) {
      bipartite = bipartite && checkBipartite(v, 1 - currentColor);
    } else {
      if (bicolor[v] == bicolor[u]) bipartite = false;
    }
  }
  return bipartite;
}
void color2(int cc, int rem) {
  if (cc == 0) return;
  if (sol[cc][rem] == true) {
    for (int i = 1; i <= n; i++) {
      if (ccIndex[i] == cc && bicolor[i] == 0) ans[i] = 2;
    }
    color2(cc - 1, rem - cntColor[cc][0]);
  } else {
    for (int i = 1; i <= n; i++) {
      if (ccIndex[i] == cc && bicolor[i] == 1) ans[i] = 2;
    }
    color2(cc - 1, rem - cntColor[cc][1]);
  }
}
void color13() {
  for (int i = 1; i <= n; i++) {
    if (ans[i] == -1) {
      if (n1 > 0) {
        ans[i] = 1;
        n1 -= 1;
      } else {
        ans[i] = 3;
        n3 -= 1;
      }
    }
  }
}
int main() {
  scanf("%d%d", &n, &m);
  scanf("%d%d%d", &n1, &n2, &n3);
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  memset(bicolor, -1, sizeof(bicolor));
  memset(cntColor, 0, sizeof(cntColor));
  numCC = 0;
  for (int i = 1; i <= n; i++) {
    if (bicolor[i] == -1) {
      numCC += 1;
      bool bipartite = checkBipartite(i, 0);
      if (!bipartite) {
        printf("NO\n");
        return 0;
      }
    }
  }
  dp[0][0] = true;
  for (int i = 1; i <= numCC; i++) {
    for (int j = 0; j <= n2; j++) {
      dp[i][j] = false;
      if (cntColor[i][0] <= j && dp[i - 1][j - cntColor[i][0]]) {
        dp[i][j] = true;
        sol[i][j] = true;
      }
      if (cntColor[i][1] <= j && dp[i - 1][j - cntColor[i][1]]) {
        dp[i][j] = true;
        sol[i][j] = false;
      }
    }
  }
  if (dp[numCC][n2] == false) {
    printf("NO\n");
    return 0;
  }
  memset(ans, -1, sizeof(ans));
  color2(numCC, n2);
  color13();
  printf("YES\n");
  for (int i = 1; i <= n; i++) printf("%d", ans[i]);
  printf("\n");
}
