#include <bits/stdc++.h>
using namespace std;
int n, m, n1, n2, n3;
vector<int> g[5001];
bool used[5001];
bool black[5001];
int blcnt[5001];
int whcnt[5001];
int cc[5001];
vector<int> comps[5001];
int first[5001];
int ccc;
bool dp[5001][5001];
bool lastblack[5001][5001];
int ans[5001];
void dfs(int v) {
  cc[v] = ccc;
  comps[ccc].push_back(v);
  for (auto w : g[v])
    if (!cc[w]) dfs(w);
}
bool bfs(int c) {
  int blackcnt = 0;
  int whitecnt = 0;
  int v = first[c];
  queue<int> q;
  q.push(v);
  used[v] = true;
  black[v] = true;
  blackcnt++;
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (auto w : g[v]) {
      if (used[w] && black[w] == black[v]) return false;
      if (!used[w]) {
        used[w] = true;
        q.push(w);
        black[w] = !black[v];
        if (black[w])
          blackcnt++;
        else
          whitecnt++;
      }
    }
  }
  blcnt[c] = blackcnt;
  whcnt[c] = whitecnt;
  return true;
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> n >> m;
  cin >> n1 >> n2 >> n3;
  for (int i = 0; i < m; ++i) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  for (int i = 0; i < n; ++i) {
    if (!cc[i]) {
      ccc++;
      first[ccc] = i;
      dfs(i);
    }
  }
  for (int i = 1; i <= ccc; ++i) {
    if (!bfs(i)) {
      cout << "NO\n";
      return 0;
    }
  }
  dp[0][0] = true;
  for (int i = 1; i <= ccc; ++i) {
    for (int j = 0; j <= n; ++j) {
      if (dp[i - 1][j]) {
        if (j + blcnt[i] <= n)
          dp[i][j + blcnt[i]] = true, lastblack[i][j + blcnt[i]] = true;
        if (j + whcnt[i] <= n)
          dp[i][j + whcnt[i]] = true, lastblack[i][j + whcnt[i]] = false;
      }
    }
  }
  if (!dp[ccc][n2]) {
    cout << "NO\n";
    return 0;
  }
  cout << "YES\n";
  int cur = n2;
  for (int i = ccc; i > 0; i--) {
    for (auto v : comps[i]) {
      if (black[v] == lastblack[i][cur]) ans[v] = 2;
    }
    if (lastblack[i][cur])
      cur -= blcnt[i];
    else
      cur -= whcnt[i];
  }
  for (int i = 0; i < n; ++i) {
    if (!ans[i]) {
      if (n1)
        cout << 1, n1--;
      else
        cout << 3;
    } else
      cout << 2;
  }
  return 0;
}
