#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, k; cin >> n >> m >> k;
	vector<int>a(n);
	vector<P>b(n);
	rep(i, n) {
		cin >> a[i];
		b[i] = { a[i],i };
	}
	sort(all(b));
	vector to(n, vector<int>());
	rep(i, m) {
		int u, v; cin >> u >> v;
		u--, v--;
		to[u].push_back(v);
		to[v].push_back(u);
	}
	dsu uf(n);
	rep(i, n) {
		for (auto e : to[b[i].second]) {
			int p = uf.leader(b[i].second);
			int q = uf.leader(e);
			if (a[p] >= a[q]
				&& a[p] - a[q] <= k) {
				a[q] = a[p];
				uf.merge(p, q);
			}
		}
	}
	if (uf.size(0) == n)cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}