#include <bits/stdc++.h>
#pragma GCC optimize("Ofast, unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native,avx2")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getrnd(int l, int r) { return uniform_int_distribution<int>(l, r)(rng); }
ll getrndll(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rng); }
template <typename T1, typename T2>
inline bool relax(T1& a, const T2& b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2>
inline bool strain(T1& a, const T2& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
int ok = 1, szb = 0, szw = 0;
vector<int> comp;
void dfs(int v, int c, vector<vector<int>>& graph, vector<int>& was) {
  if (was[v]) {
    if (was[v] != c) ok = 0;
    return;
  }
  if (c == 1)
    ++szw;
  else
    ++szb;
  was[v] = c;
  comp.push_back(v);
  for (int to : graph[v]) dfs(to, 3 - c, graph, was);
}
void solve() {
  int n, m;
  cin >> n >> m;
  int n1, n2, n3;
  cin >> n1 >> n2 >> n3;
  vector<vector<int>> graph(n);
  for (int i = 0; i < m; ++i) {
    int x, y;
    cin >> x >> y;
    --x;
    --y;
    graph[x].emplace_back(y);
    graph[y].emplace_back(x);
  }
  vector<int> was(n);
  vector<vector<int>> comps;
  vector<pair<int, int>> split;
  for (int i = 0; i < n; ++i) {
    if (!was[i]) {
      szb = szw = 0;
      ok = 1;
      comp.clear();
      dfs(i, 1, graph, was);
      if (!ok) {
        cout << "NO\n";
        return;
      }
      comps.push_back(comp);
      split.emplace_back(szw, szb);
    }
  }
  vector<char> dp(n + 1);
  vector<vector<int>> from(split.size(), vector<int>(n + 1));
  dp[0] = 1;
  for (int i = 0; i < split.size(); ++i) {
    int a = split[i].first, b = split[i].second;
    for (int j = n; j >= 0; --j) {
      if (j >= a && dp[j - a])
        dp[j] = 1, from[i][j] = 0;
      else if (j >= b && dp[j - b])
        dp[j] = 1, from[i][j] = 1;
      else
        dp[j] = 0;
    }
  }
  if (!dp[n2]) {
    cout << "NO\n";
    return;
  }
  int have = n2;
  string ans(n, '-');
  for (int i = split.size() - 1; i >= 0; --i) {
    int a = split[i].first, b = split[i].second;
    for (int j = 0; j < comps[i].size(); ++j) {
      if (was[comps[i][j]] - 1 == from[i][have]) ans[comps[i][j]] = '2';
    }
    if (from[i][have] == 0)
      have -= a;
    else
      have -= b;
  }
  for (int i = 0; i < n; ++i) {
    if (ans[i] == '-') {
      if (n1)
        ans[i] = '1', --n1;
      else
        ans[i] = '3', --n3;
    }
  }
  cout << "YES\n" << ans << '\n';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(nullptr);
  cout.tie(nullptr);
  srand(time(0));
  int t = 1;
  while (t--) solve();
  return 0;
}
