#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 5e3 + 10;
vector<int> g[N], a[N], b[N];
int vis[N], col[N], c[3];
int dp[N][N], res[N][N], ans[N];
int cnt = 0;
void dfs(int x) {
  vis[x]++;
  if (col[x])
    a[cnt].push_back(x);
  else
    b[cnt].push_back(x);
  for (auto it : g[x]) {
    if (!vis[it]) {
      col[it] = (col[x] ^ 1);
      dfs(it);
    } else if (col[it] == col[x]) {
      puts("NO");
      exit(0);
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < 3; i++) cin >> c[i];
  for (int i = 0, x, y; i < m; i++) {
    cin >> x >> y;
    g[x].push_back(y), g[y].push_back(x);
  }
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      col[i] = 0;
      ++cnt;
      dfs(i);
      for (int j = 0; j <= n; j++) {
        if (j >= (int)a[cnt].size() && dp[cnt - 1][j - (int)a[cnt].size()]) {
          dp[cnt][j] = 1;
          res[cnt][j] = 1;
        }
        if (j >= (int)b[cnt].size() && dp[cnt - 1][j - (int)b[cnt].size()]) {
          dp[cnt][j] = 1;
          res[cnt][j] = 0;
        }
      }
    }
  }
  if (!dp[cnt][c[1]]) {
    puts("NO");
    return 0;
  }
  for (int i = cnt, tot = c[1]; i; i--) {
    if (res[i][tot]) {
      for (auto it : a[i]) ans[it] = 2;
      tot -= (int)a[i].size();
    } else {
      for (auto it : b[i]) ans[it] = 2;
      tot -= (int)b[i].size();
    }
  }
  for (int i = 1; i <= n; i++) {
    if (!ans[i]) {
      if (c[0])
        ans[i] = 1, c[0]--;
      else
        ans[i] = 3, c[2]--;
    }
  }
  cout << "YES" << '\n';
  for (int i = 1; i <= n; i++) cout << ans[i];
  return 0;
}
