/**
	author:  shobonvip
	created: 2025.04.06 16:45:45
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, m, k; cin >> n >> m >> k;
	vector<ll> a(n);
	rep(i,0,n) {
		cin >> a[i];
	}

	dsu uf(n);
	vector<tuple<ll,int,int>> event;
	rep(i,0,m) {
		int u, v; cin >> u >> v;
		u--; v--;
		if (a[u] > a[v]) swap(u, v);
		event.push_back(
			make_tuple(
				max(a[u],a[v]),
				u,
				v
			)
		);
	}

	sort(all(event));
	for(auto[val,i,j]: event) {
		i = uf.leader(i);
		j = uf.leader(j);
		if (uf.same(i, j)) continue;
		if (a[j] - a[i] > k) continue;
		uf.merge(i, j);
		a[uf.leader(i)] = val;
	}

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