#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N,M,K;cin>>N>>M>>K;
  vl A(N);cin>>A;
  vvl E(N);
  rep(i,0,M){
  	ll u,v;cin>>u>>v;u--;v--;
  	E[u].emplace_back(v);
  	E[v].emplace_back(u);
  }
  dsu G(N);
  min_priority_queue<pl>Q;
  rep(i,0,N)Q.emplace(pl(A[i],i));
  vector<set<pl>>es(N);
  rep(i,0,N)for(auto j:E[i])es[i].insert(pl(A[j],j));
  while(sz(Q)){
  	auto [a,v]=Q.top();Q.pop();
  	if(v!=G.leader(v)||a!=A[v])continue;
  	while(sz(es[v])){
  		auto[b,u]=*es[v].begin();
  		if(u!=G.leader(u)||b!=A[u]||G.same(u,v)){
  			es[v].erase(es[v].begin());
  			if(u==G.leader(u)&&!G.same(u,v))es[v].insert(pl(A[u],u));
  		}
  		else break;
  	}
  	if(!sz(es[v]))continue;
  	auto[b,u]=*es[v].begin();
  	if(b>a+K){cout<<"No"<<endl;return 0;}
  	auto w=G.merge(u,v);
  	if(sz(es[w])<sz(es[u+v-w]))swap(es[w],es[u+v-w]);
  	for(auto p:es[u+v-w])es[w].insert(p);
  	A[w]=b;
  	Q.emplace(pl(A[w],w));
  }
  cout<<"Yes"<<endl;
  return 0;
}