#include <bits/stdc++.h>
using namespace std;
int n, m;
struct edge {
  int v, next;
  edge() {}
  edge(int _v, int _next) {
    v = _v;
    next = _next;
  }
} e[200001];
int head[100001], sz;
void init() {
  memset(head, -1, sizeof(head));
  sz = 0;
}
void insert(int u, int v) {
  e[++sz] = edge(v, head[u]);
  head[u] = sz;
}
int col[100001], ccn[100001], a[100001][2], cc, dp[5001][5001], nd[100001],
    lst[5001][5001], n1, n2, n3, ans[5001];
void dfs(int u, int c) {
  ++a[cc][c];
  ccn[u] = cc;
  col[u] = c;
  for (int i = head[u]; ~i; i = e[i].next) {
    if (!~col[e[i].v]) dfs(e[i].v, c ^ 1);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  init();
  scanf("%d%d%d", &n1, &n2, &n3);
  for (int i = 1; i <= m; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    insert(u, v);
    insert(v, u);
  }
  memset(col, -1, sizeof(col));
  for (int i = 1; i <= n; ++i)
    if (!~col[i]) ++cc, dfs(i, 0);
  bool flg = true;
  for (int i = 1; i <= n; ++i)
    for (int j = head[i]; ~j; j = e[j].next)
      if (col[e[j].v] == col[i]) {
        flg = false;
        break;
      }
  if (!flg) {
    printf("NO\n");
    return 0;
  }
  dp[0][0] = 1;
  for (int i = 1; i <= cc; ++i)
    for (int j = 0; j <= n; ++j)
      for (int k = 0; k < 2; ++k)
        if (j >= a[i][k] && dp[i - 1][j - a[i][k]])
          dp[i][j] |= dp[i - 1][j - a[i][k]], lst[i][j] = k;
  if (!dp[cc][n2]) {
    printf("NO\n");
    return 0;
  }
  int I = cc, J = n2;
  while (I) {
    nd[I] = lst[I][J];
    J -= a[I][lst[I][J]];
    --I;
  }
  int cnt1 = 0;
  for (int i = 1; i <= n; ++i) {
    if (col[i] == nd[ccn[i]]) {
      ans[i] = 2;
    } else if (cnt1 < n1)
      ans[i] = 1, ++cnt1;
    else
      ans[i] = 3;
  }
  printf("YES\n");
  for (int i = 1; i <= n; ++i) printf("%d", ans[i]);
  putchar(10);
  return 0;
}
