/* -*- coding: utf-8 -*-
 *
 * 3093.cc:  No.3093 Safe Infection - yukicoder
 */

#include<cstdio>
#include<vector>
#include<set>
#include<algorithm>
#include<tuple>

using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_M = 100000;

/* typedef */

using tp4 = tuple<int,int,int,int>;
using stp4 = set<tp4>;

struct UFT {
  vector<int> links, ranks, sizes;
  UFT() {}

  void init(int n) {
    links.resize(n);
    for (int i = 0; i < n; i++) links[i] = i;
    ranks.assign(n, 1);
    sizes.assign(n, 1);
  }

  int root(int i) {
    int i0 = i;
    while (links[i0] != i0) i0 = links[i0];
    return (links[i] = i0);
  }

  int rank(int i) { return ranks[root(i)]; }
  int size(int i) { return sizes[root(i)]; }
  bool same(int i, int j) { return root(i) == root(j); }

  int merge(int i0, int i1) {
    int r0 = root(i0), r1 = root(i1), mr;
    if (r0 == r1) return r0;
    if (ranks[r0] == ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      ranks[r0]++;
      mr = r0;
    }
    else if (ranks[r0] > ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      mr = r0;
    }
    else {
      links[r0] = r1;
      sizes[r1] += sizes[r0];
      mr = r1;
    }
    return mr;
  }
};

/* global variables */

int as[MAX_N];
tp4 es[MAX_M];
UFT uft;

/* subroutines */

/* main */

int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    int a0 = as[u], a1 = as[v];
    if (a0 > a1) swap(a0, a1), swap(u, v);
    es[i] = {a0, a1, u, v};
  }
  sort(es, es + m);

  stp4 ses(es, es + m);
  uft.init(n);

  while (! ses.empty() && uft.size(0) < n) {
    auto [au, av, u, v] = *ses.begin();
    ses.erase(ses.begin());

    int ru = uft.root(u), rv = uft.root(v);
    if (ru != rv) {
      int a0 = as[ru], a1 = as[rv];
      if (a0 > a1) swap(a0, a1), swap(ru, rv);
      
      if (a0 != au || a1 != av) {
	ses.insert({a0, a1, ru, rv});
      }
      else {
	if (a1 - a0 > k) { puts("No"); return 0; }
	int r = uft.merge(ru, rv);
	as[r] = a1;
      }
    }
  }

  puts("Yes");
  return 0;
}