#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
bool uin(T &a, T b) {
  return a > b ? (a = b, true) : false;
}
template <class T>
bool uax(T &a, T b) {
  return a < b ? (a = b, true) : false;
}
vector<int> level, colors;
vector<vector<int>> g;
vector<pii> ccs, arr;
vector<vector<pii>> allccs;
bool ok;
void bfs(int start, vector<pii> &ccs) {
  level[start] = 0;
  ccs.emplace_back(start, 0);
  queue<int> Q;
  Q.push(start);
  while (!Q.empty()) {
    int curr = Q.front();
    Q.pop();
    for (auto &v : g[curr]) {
      if (level[v] != -1 && !((level[v] % 2) ^ (level[curr] % 2))) {
        ok = false;
        return;
      } else if (level[v] != -1)
        continue;
      level[v] = 1 + level[curr];
      ccs.emplace_back(v, level[v]);
      Q.push(v);
    }
  }
}
int main(void) {
  int n, m;
  ok = true;
  scanf("%d%d", &n, &m);
  int n1, n2, n3;
  scanf("%d%d%d", &n1, &n2, &n3);
  level.resize(n, -1);
  g.resize(n);
  colors.resize(n, -1);
  for (int i = 0; i < m; i++) {
    int from, to;
    scanf("%d%d", &from, &to);
    --from, --to, g[from].push_back(to), g[to].push_back(from);
  }
  for (int i = 0; i < n; i++) {
    if (level[i] != -1) continue;
    if (level[i] == -1) bfs(i, ccs);
    if (!ok) {
      puts("NO");
      return 0;
    }
    int ev = 0, od = 0;
    for (auto &x : ccs) {
      if (x.second % 2 == 0)
        ++ev;
      else
        ++od;
    }
    arr.emplace_back(ev, od);
    allccs.emplace_back(ccs);
    ccs.clear();
  }
  if (!n2 && (int)(allccs).size() != n) {
    puts("NO");
    return 0;
  }
  int s = (int)(allccs).size();
  vector<vector<int>> dp(s, vector<int>(n2 + 1, 0));
  vector<vector<int>> parity(s, vector<int>(n2 + 1, -1));
  dp[0][min(n2, arr[0].first)] = dp[0][min(n2, arr[0].second)] = 1;
  for (int i = 1; i <= s - 1; i++) {
    for (int j = 0; j < n2 + 1; j++) {
      if (j - arr[i].first >= 0 && j - arr[i].first <= n2) {
        dp[i][j] |= dp[i - 1][j - arr[i].first];
        if (dp[i - 1][j - arr[i].first]) parity[i][j] = 0;
      }
      if (j - arr[i].second >= 0 && j - arr[i].second <= n2) {
        dp[i][j] |= dp[i - 1][j - arr[i].second];
        if (dp[i - 1][j - arr[i].second]) parity[i][j] = 1;
      }
    }
  }
  0;
  if (!dp[s - 1][n2]) {
    puts("NO");
    return 0;
  }
  int pos = s - 1;
  while (pos > 0) {
    0;
    int pp = parity[pos][n2];
    for (auto &x : allccs[pos]) {
      if (!((x.second % 2) ^ pp)) {
        colors[x.first] = 2;
        --n2;
      } else {
        if (n1 > 0)
          colors[x.first] = 1, --n1;
        else
          colors[x.first] = 3, --n3;
      }
    }
    --pos;
  }
  assert(n2 == arr[0].first || n2 == arr[0].second);
  int pp = -1;
  if (n2 == arr[0].first)
    pp = 0;
  else
    pp = 1;
  for (auto &x : allccs[0]) {
    if (!((x.second % 2) ^ pp))
      colors[x.first] = 2;
    else if (n1 > 0)
      colors[x.first] = 1, --n1;
    else
      colors[x.first] = 3, --n3;
  }
  puts("YES");
  for (int i = 0; i < n; i++) printf("%d", colors[i]);
  return 0;
}
