#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using std::pair;
using std::queue;
using std::swap;
using std::vector;
int main() {
  int n, m;
  cin >> n >> m;
  vector<int> Lim(3);
  cin >> Lim[0] >> Lim[1] >> Lim[2];
  vector<vector<int> > Graph(n);
  while (m != 0) {
    --m;
    int u, v;
    cin >> u >> v;
    Graph[u - 1].push_back(v - 1);
    Graph[v - 1].push_back(u - 1);
  }
  vector<int> IsVisited(n, 0);
  vector<pair<vector<int>, vector<int> > > Components;
  for (int i = 0; i < Graph.size(); ++i) {
    if (IsVisited[i] != 0) {
      continue;
    }
    Components.emplace_back(vector<int>(), vector<int>());
    queue<int> Q;
    Q.push(i);
    int color = 1;
    IsVisited[i] = 1;
    Components[Components.size() - 1].second.push_back(i);
    while (!Q.empty()) {
      int vertex = Q.front();
      Q.pop();
      color = IsVisited[vertex];
      for (int j = 0; j < Graph[vertex].size(); ++j) {
        if (IsVisited[Graph[vertex][j]] == 0) {
          IsVisited[Graph[vertex][j]] = -color;
          Q.push(Graph[vertex][j]);
          if (color == -1) {
            Components[Components.size() - 1].second.push_back(
                Graph[vertex][j]);
          } else {
            Components[Components.size() - 1].first.push_back(Graph[vertex][j]);
          }
        } else if (IsVisited[Graph[vertex][j]] == color) {
          cout << "NO" << endl;
          return 0;
        }
      }
    }
  }
  vector<vector<int> > IsPossible(Components.size() + 1, vector<int>(n + 1, 0));
  vector<vector<int> > Added(Components.size() + 1, vector<int>(n + 1, 0));
  IsPossible[0][0] = -1;
  for (int i = 0; i < Components.size(); ++i) {
    for (int j = 0; j < n; ++j) {
      if (IsPossible[i][j] != 0) {
        IsPossible[i + 1][j + Components[i].first.size()] = 1;
        Added[i + 1][j + Components[i].first.size()] =
            Components[i].first.size();
        IsPossible[i + 1][j + Components[i].second.size()] = 2;
        Added[i + 1][j + Components[i].second.size()] =
            Components[i].second.size();
      }
    }
  }
  if (IsPossible[Components.size()][Lim[1]] == 0) {
    cout << "NO" << endl;
    return 0;
  }
  vector<int> Answer(n);
  int color_lim = 0;
  int j = Lim[1];
  int i = Components.size();
  while (i != 0 || j != 0) {
    if (IsPossible[i][j] == 1) {
      j -= Added[i][j];
      --i;
      for (int k = 0; k < Components[i].first.size(); ++k) {
        Answer[Components[i].first[k]] = 2;
      }
      int k = 0;
      while (k < Components[i].second.size() && color_lim < Lim[0]) {
        Answer[Components[i].second[k]] = 1;
        ++color_lim;
        ++k;
      }
      while (k < Components[i].second.size() && color_lim >= Lim[0]) {
        Answer[Components[i].second[k]] = 3;
        ++color_lim;
        ++k;
      }
    } else {
      j -= Added[i][j];
      --i;
      for (int k = 0; k < Components[i].second.size(); ++k) {
        Answer[Components[i].second[k]] = 2;
      }
      int k = 0;
      while (k < Components[i].first.size() && color_lim < Lim[0]) {
        Answer[Components[i].first[k]] = 1;
        ++color_lim;
        ++k;
      }
      while (k < Components[i].first.size() && color_lim >= Lim[0]) {
        Answer[Components[i].first[k]] = 3;
        ++color_lim;
        ++k;
      }
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < Answer.size(); ++i) {
    cout << Answer[i];
  }
  return 0;
}
