#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 4e5 + 10;

long long gcd(long long a, long long b) {
    if (b == 0) {
        return a;
    }
    return gcd(b, a % b);
}

long long lcm(long long a, long long b) {
    return a * b / gcd(a, b);
}

bool used[MAXN] {false};
int color[MAXN];
vector <vector <int>> v;

bool isSafe(int node, int c) {
    for (int i : v[node])
        if (c == color[i]) {
            return false;
        }
    return true;
}

bool graph_coloring(int n, int m, int node) {
    if (node == n) {
        return true;
    }
    for (int c = 1; c <= m; c++) {
        if (isSafe(node, c)) {
            color[node] = c;
            if (graph_coloring(n, m, node + 1)) {
                return true;
            }
            color[node] = 0;
        }
    }
    return false;
}

void task3() {
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 0; i < n; i++) {
        cin >> color[i];
    }
    bool flag;
    v.resize(n);
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    flag = graph_coloring(n, k, 0);
    if (flag) {
        cout << "Yes" << endl;
        for (int i = 0; i < n; i++) {
            cout << color[i] << " ";
        }
    }
    else {
        cout << "No";
    }
}

int main() {
    task3();
    return 0;
}