#include <bits/stdc++.h>
using namespace std;
const int maxn = 5000 + 10;
int N, M, cnt[4], C[maxn], memo[maxn][maxn];
vector<pair<vector<int>, vector<int>>> comps;
vector<int> graph[maxn];
string str;
int dp(int pos, int k) {
  if (k < 0) return 0;
  if (pos >= (int)comps.size()) {
    if (k == 0) return 1;
    return 0;
  }
  int &res = memo[pos][k];
  if (res != -1) return res;
  res = dp(pos + 1, k - comps[pos].first.size());
  res |= dp(pos + 1, k - comps[pos].second.size());
  return res;
}
void print(int pos, int k) {
  if (k < 0) return;
  if (pos >= (int)comps.size()) return;
  int &res = memo[pos][k];
  if (res == dp(pos + 1, k - comps[pos].first.size())) {
    for (auto &x : comps[pos].first) {
      str[x] = '2';
    }
    print(pos + 1, k - comps[pos].first.size());
  } else {
    for (auto &x : comps[pos].second) {
      str[x] = '2';
    }
    print(pos + 1, k - comps[pos].second.size());
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  for (int i = 0; i < maxn; i++)
    for (int j = 0; j < maxn; j++) memo[i][j] = -1;
  cin >> N >> M;
  for (int i = 1; i <= 3; i++) cin >> cnt[i];
  for (int i = 0; i < M; i++) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    graph[u].push_back(v);
    graph[v].push_back(u);
  }
  for (int i = 0; i < N; i++) {
    C[i] = -1;
    str += '0';
  }
  for (int i = 0; i < N; i++) {
    if (C[i] != -1) continue;
    pair<vector<int>, vector<int>> act;
    queue<int> Q;
    Q.push(i);
    C[i] = 0;
    bool can = true;
    while (Q.size()) {
      int u = Q.front();
      Q.pop();
      if (C[u] == 0)
        act.first.push_back(u);
      else
        act.second.push_back(u);
      for (auto &v : graph[u]) {
        if (C[v] == -1) {
          C[v] = !C[u];
          Q.push(v);
        } else if (C[v] == C[u]) {
          can = false;
        }
      }
    }
    comps.push_back(act);
    if (!can) {
      cout << "NO\n";
      return 0;
    }
  }
  int r = dp(0, cnt[2]);
  if (!r)
    cout << "NO\n";
  else {
    print(0, cnt[2]);
    for (int i = 0; i < N; i++) {
      if (str[i] != '0') continue;
      if (cnt[1]) {
        str[i] = '1';
        cnt[1]--;
        continue;
      }
      if (cnt[3]) {
        str[i] = '3';
        cnt[3]--;
        continue;
      }
      cout << "NO\n";
      return 0;
    }
    if (cnt[1] || cnt[3]) {
      cout << "NO\n";
      return 0;
    }
    cout << "YES\n";
    cout << str << '\n';
  }
  return 0;
}
