#include <bits/stdc++.h>
using namespace std;
bool endline = false;
template <class T>
istream& operator>>(istream& inp, vector<T>& v) {
  for (auto& it : v) inp >> it;
  return inp;
}
template <class T>
ostream& operator<<(ostream& out, vector<T>& v) {
  for (auto& it : v) out << it << (endline ? "\n" : " ");
  return out;
}
template <class T, class U>
istream& operator>>(istream& inp, pair<T, U>& v) {
  inp >> v.first >> v.second;
  return inp;
}
template <class T, class U>
ostream& operator<<(ostream& out, pair<T, U>& v) {
  out << v.first << ' ' << v.second;
  return out;
}
void FAST_IO(string filein = "", string fileout = "") {
  if (fopen(filein.c_str(), "r")) {
    freopen(filein.c_str(), "r", stdin);
    freopen(fileout.c_str(), "w", stdout);
  }
  cin.tie(0), cout.tie(0)->sync_with_stdio(0);
}
void Hollwo_Pelw();
signed main() {
  FAST_IO("input.inp", "output.out");
  int testcases = 1;
  for (int test = 1; test <= testcases; test++) {
    Hollwo_Pelw();
  }
  return 0;
}
const int allmod[3] = {(int)1e9 + 7, 998244353, (int)1e9 + 9};
const int mod = allmod[1];
const int MAXN = 5e3 + 5;
const int inf = 2e9;
const long long linf = 1e18;
long long n, n1, n2, n3, m, comp, col[MAXN];
vector<long long> adj[MAXN];
vector<long long> in[MAXN][2];
void kill() {
  cout << "NO";
  exit(0);
}
void dfs(long long u, long long c) {
  col[u] = c;
  in[comp][c].push_back(u);
  for (auto v : adj[u]) {
    if (col[v] == -1)
      dfs(v, c ^ 1);
    else if (col[v] == col[u])
      kill();
  }
}
long long dp[MAXN][MAXN];
void Hollwo_Pelw() {
  cin >> n >> m >> n1 >> n2 >> n3;
  for (long long i = 1, u, v; i <= m; i++)
    cin >> u >> v, adj[u].push_back(v), adj[v].push_back(u);
  for (long long i = 1; i <= n; i++) col[i] = -1;
  for (long long i = 1; i <= n; i++)
    if (col[i] == -1) ++comp, dfs(i, 0);
  dp[0][0] = 1;
  for (long long i = 1; i <= comp; i++) {
    for (long long j = 0; j <= n2; j++) {
      long long j1 = j - in[i][0].size();
      long long j2 = j - in[i][1].size();
      dp[i][j] = (j1 >= 0 && dp[i - 1][j1]) || (j2 >= 0 && dp[i - 1][j2]);
    }
  }
  if (!dp[comp][n2]) kill();
  long long cur = n2;
  for (long long i = n; i >= 1; i--) {
    long long nxt1 = cur - in[i][0].size();
    long long nxt2 = cur - in[i][1].size();
    if (dp[i - 1][nxt1]) {
      for (auto v : in[i][0]) col[v] = 2;
      for (auto v : in[i][1]) col[v] = 3;
      cur = nxt1;
    } else {
      for (auto v : in[i][0]) col[v] = 3;
      for (auto v : in[i][1]) col[v] = 2;
      cur = nxt2;
    }
  }
  cout << "YES\n";
  for (long long i = 1; i <= n; i++) {
    if (n1 && col[i] == 3) col[i] = 1, n1--;
    cout << col[i];
  }
}
