#include <bits/stdc++.h>
using namespace std;
vector<int> g[5010];
int c[5010];
int ans[50010];
int a[4], t = 0;
bool flag = true;
int n1, n2, n3;
void dfs1(int x) {
  a[c[x]]++;
  if (flag == false) return;
  for (int i = 0; i < g[x].size(); i++) {
    int v = g[x][i];
    if (c[v] && c[v] != 3 - c[x]) {
      flag = false;
      return;
    }
    if (c[v] == 3 - c[x]) continue;
    c[v] = 3 - c[x];
    dfs1(v);
  }
}
void dfs2(int x) {
  ans[x] = c[x] == t ? 2 : n1 > n3 ? 1 : 3;
  if (ans[x] == 1) n1--;
  if (ans[x] == 2) n2--;
  if (ans[x] == 3) n3--;
  for (int i = 0; i < g[x].size(); i++) {
    int v = g[x][i];
    if (ans[v]) continue;
    dfs2(v);
  }
}
vector<pair<int, int>> v;
short dp[5011][5011], pre[5011][5011];
int main(int argc, char const *argv[]) {
  int n, m;
  scanf("%d%d", &n, &m);
  scanf("%d%d%d", &n1, &n2, &n3);
  int x, y;
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &x, &y);
    g[x].push_back(y);
    g[y].push_back(x);
  }
  flag = true;
  for (int i = 1; i <= n; i++) {
    if (!c[i]) {
      c[i] = 1;
      a[1] = a[2] = 0;
      dfs1(i);
      v.push_back({a[1], a[2]});
    }
  }
  dp[0][0] = 1;
  for (int i = 1; i <= v.size(); i++) {
    for (int j = n2; j >= 0; j--) {
      int p = i - 1;
      if (j >= v[p].first && dp[i - 1][j - v[p].first]) {
        dp[i][j] = 1, pre[i][j] = 1;
      } else if (j >= v[p].second && dp[i - 1][j - v[p].second]) {
        dp[i][j] = 1, pre[i][j] = 2;
      }
    }
  }
  if (!flag || !dp[v.size()][n2]) {
    printf("NO\n");
    return 0;
  }
  int all_comp = v.size() - 1;
  vector<int> all_;
  int now_j = n2;
  int now_i = v.size();
  while (now_i > 0) {
    if (pre[now_i][now_j] == 2) {
      now_j -= v[now_i - 1].second;
      all_.push_back(2);
    } else {
      now_j -= v[now_i - 1].first;
      all_.push_back(1);
    }
    now_i--;
  }
  int nw = 0;
  for (int i = 1; i <= n; i++) {
    if (!ans[i]) {
      t = all_[all_comp - nw];
      dfs2(i);
      nw++;
    }
  }
  printf("YES\n");
  for (int i = 1; i <= n; i++) printf("%d", ans[i]);
  printf("\n");
  return 0;
}
