#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
long long MOD = 998244353;
long long exp(long long n, long long e) {
  if (e == 0) return 1;
  long long temp = exp((n * n) % MOD, e / 2);
  return e % 2 == 0 ? temp : (temp * n) % MOD;
}
long long inverse(long long n) { return exp(n, MOD - 2); }
void frac(long long p, long long q) {
  cout << (p * inverse(q)) % MOD << endl;
  ;
}
int LIM = 6000;
vector<vector<long long> > adj(LIM);
vector<long long> visited(LIM, 0);
vector<long long> color(LIM, -1);
bool f = 0;
vector<long long> pos(LIM);
int num;
void dfs(int n, vector<long long> &cnt) {
  visited[n] = 1;
  pos[n] = num;
  cnt[color[n]]++;
  for (int i = 0; i < ((long long)(adj[n]).size()); i++) {
    if (visited[adj[n][i]] == 0) {
      color[adj[n][i]] = 1 - color[n];
      dfs(adj[n][i], cnt);
    } else {
      if (color[adj[n][i]] == color[n]) {
        f = 1;
      }
    }
  }
}
void solve(int t) {
  int n, m1;
  cin >> n >> m1;
  int n1, n2, n3;
  cin >> n1 >> n2 >> n3;
  for (int i = 1; i <= m1; i++) {
    int a, b;
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  vector<pair<long long, long long> > arr(1);
  for (int i = 1; i <= n; i++) {
    if (visited[i] == 0) {
      num++;
      vector<long long> cnt(2, 0);
      color[i] = 0;
      dfs(i, cnt);
      if (f == 1) {
        cout << "NO" << endl;
        return;
      }
      arr.push_back(pair<long long, long long>(cnt[0], cnt[1]));
    }
  }
  int m = ((long long)(arr).size()) - 1;
  vector<vector<int> > dp(m + 1, vector<int>(n2 + 1, 0));
  dp[0][0] = 1;
  for (int i = 1; i <= m; i++) {
    for (int j = 0; j <= n2; j++) {
      if (j >= arr[i].first && dp[i - 1][j - arr[i].first]) dp[i][j] = 1;
      if (j >= arr[i].second && dp[i - 1][j - arr[i].second]) {
        dp[i][j] = 2;
      }
    }
  }
  if (dp[m][n2] == 0) {
    cout << "NO" << endl;
  } else {
    vector<long long> ans(m + 1);
    int current = n2;
    vector<long long> fans(n + 1, 0);
    for (int i = m; i >= 1; i--) {
      ans[i] = (dp[i][current]);
      if (dp[i][current] == 1)
        current -= arr[i].first;
      else
        current -= arr[i].second;
    }
    for (int i = 1; i <= n; i++) {
      if (ans[pos[i]] - 1 == color[i])
        fans[i] = 2;
      else {
        if (n1 > 0) {
          fans[i] = 1;
          n1--;
        } else {
          fans[i] = 3;
        }
      }
    }
    cout << "YES" << endl;
    for (int i = 1; i <= n; i++) cout << fans[i];
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  for (int i = 1; i <= t; i++) {
    solve(i);
  }
  return 0;
}
