#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5007;
int n, m, n1, n2, n3, d[MAXN], c[MAXN], sz = 0, root[MAXN], cnt[MAXN];
bool dp[MAXN][MAXN] = {};
bitset<MAXN> vis;
vector<int> adj[MAXN];
void dfs(int u, bool tp) {
  vis[u] = 1, d[sz] += tp, c[u] = tp, ++cnt[sz];
  for (auto v : adj[u])
    if (!vis[v]) dfs(v, tp ^ 1);
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m >> n1 >> n2 >> n3;
  while (m--) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v), adj[v].push_back(u);
  }
  for (int i = 1; i <= n; ++i)
    if (!vis[i]) ++sz, dfs(i, 0), root[sz] = i;
  for (int i = 1; i <= n; ++i)
    for (auto v : adj[i])
      if (c[i] == c[v]) return cout << "NO", 0;
  dp[0][0] = 1;
  for (int i = 1; i <= sz; ++i)
    for (int j = 0; j <= n2; ++j) {
      if (j >= d[i]) dp[i][j] |= dp[i - 1][j - d[i]];
      if (j >= cnt[i] - d[i]) dp[i][j] |= dp[i - 1][j - cnt[i] + d[i]];
    }
  if (!dp[sz][n2])
    cout << "NO";
  else {
    cout << "YES\n";
    for (int i = 1; i <= n; ++i) vis[i] = 0;
    int j = n2;
    ++sz;
    for (int i = sz - 1; i >= 1; --i) {
      if (j >= d[i] && dp[i - 1][j - d[i]]) {
        j -= d[i], dfs(root[i], 0);
        continue;
      }
      j -= (cnt[i] - d[i]), dfs(root[i], 1);
    }
    for (int i = 1; i <= n; ++i)
      if (c[i])
        cout << 2;
      else {
        if (n3)
          cout << 3, --n3;
        else
          cout << 1;
      }
  }
}
