#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


struct union_find{
    vector<int> par;
    vector<int> siz;
    
    union_find(int n) : par(n), siz(n, 1){
        for(int i=0; i<n; i++) par[i] = i;
    }
    
    int root(int x){
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }
 
    void unite(int x, int y){
        int rx = root(x);
        int ry = root(y);
        if (rx == ry) return;
        if (siz[rx] < siz[ry]) swap(rx, ry);
        siz[rx] += siz[ry];
        par[ry] = rx;
    }
 
    bool same(int x, int y){
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
 
    int size(int x){
        return siz[root(x)];
    }
};


void solve(){
    int n, m, k; cin >> n >> m >> k;
    vector<int> a(n); for(int i=0; i<n; i++) cin >> a[i];
    vector<vector<int>> G(n);
    for(int i=0; i<m; i++){
        int u, v; cin >> u >> v;
        u--; v--;
        G[u].pb(v);
        G[v].pb(u);
    }

    union_find uf(n);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> que;
    for(int v=0; v<n; v++) que.push({a[v], v});
    while(!que.empty()){
        auto [av, v] = que.top(); que.pop();
        int rv = uf.root(v);
        vector<pair<int, int>> s;
        for(int to : G[v]){
            if(uf.same(v, to)) continue;
            int rto = uf.root(to);
            s.pb({a[rto], rto});
        }
        sort(all(s));
        for(auto [tmp, rto] : s){
            if(uf.same(rv, rto)) continue;
            if(abs(a[rv]-a[rto]) <= k){
                int mx = max(a[rv], a[rto]);
                uf.unite(rv, rto);
                a[uf.root(rv)] = mx;
                rv = uf.root(rv);
            }
        }
    }

    if(uf.size(0) == n) cout << "Yes\n";
    else cout << "No\n";
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}