#include <bits/stdc++.h>
using namespace std;
#define int long long
int N,M,K;
int A[100100];
struct Unionfind{
private:
	int n;
	vector<int> par, siz;
public:
	Unionfind(int N){
		n = N;
		par.resize(n,-1);
		siz.resize(n,1);
	}
	int root(int a){
		if(par[a] == -1) return a;
		else return par[a] = root(par[a]);
	}
	bool issame(int a, int b){
		return (root(a) == root(b));
	}
	int size(int a){
		return siz[root(a)];
	}
	bool unite(int a, int b){
		a = root(a);
		b = root(b);
		if(a == b) return false;
		if(siz[a] > siz[b]) swap(a,b);
		siz[b] += siz[a];
		par[a] = b;
		A[b] = max(A[a],A[b]);
		return true;
	}
};
signed main(){
    cin>>N>>M>>K;
    for(int i=0;i<N;i++) cin>>A[i];
    vector<pair<int,int>> S(M);
    for(int i=0;i<M;i++){
    	int a,b;
    	cin>>a>>b;
    	a--;
    	b--;
    	if(A[a] < A[b]) swap(a,b);
    	S[i] = {a,b};
    }
    sort(S.begin(),S.end(),[&](const pair<int,int> a, pair<int,int> b){
    	if(A[a.first] != A[b.first]) return (A[a.first] < A[b.first]);
    	else return (A[a.second] < A[b.second]);
    });
    Unionfind uf(N);
    for(auto [a,b]:S){
    	a = uf.root(a);
    	b = uf.root(b);
    	if(uf.issame(a,b)) continue;
    	if(abs(A[a]-A[b]) > K){
    		cout<<"No"<<endl;
    		return 0;
    	}
    	uf.unite(a,b);
    }
    cout<<"Yes"<<endl;
}