#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
//using mint = modint998244353;

//多倍長整数//
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//using bint = mp::cpp_int;

const int INF = 1e9;
const int MOD = 998244353;
const long long LINF = 4e18;

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using vvl = vector<vector<long long>>;
using vvvl = vector<vector<vector<long long>>>;
using vvvvl = vector<vector<vector<vector<long long>>>>;
using vvc = vector<vector<char>>;
using vvb = vector<vector<bool>>;
using vvvb = vector<vector<vector<bool>>>;
using vvvvb = vector<vector<vector<vector<bool>>>>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define dump(x)  cout << #x << " = " << (x) << endl;
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define ALL(obj) (obj).begin(),(obj).end()

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m,k;
    cin >> n >> m >> k;
    vi a(n);
    rep(i,n) cin >> a[i];
    vvi g(n);
    rep(i,m){
        int u,v;
        cin >> u >> v;
        u--,v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dsu uf(n);
    vector<pair<int,int>> so(n);
    rep(i,n) so[i] = {a[i], i};
    sort(ALL(so));
    for(auto [_, i] : so){
        for(auto next : g[i]){
            if(a[uf.leader(i)] >= a[uf.leader(next)] && a[uf.leader(i)] - a[uf.leader(next)] <= k){
                int tmp = a[uf.leader(i)];
                uf.merge(i, next);
                a[uf.leader(i)] = tmp;
            }
        }
    }
    if(uf.size(0) == n) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}