class UnionFind:
    def __init__(self, n: int):
        self.data = [-1] * (n+1)
        self.nexts = [i for i in range(n+1)]

    def root(self, a: int) -> int:
        if self.data[a] < 0: return a
        self.data[a] = self.root(self.data[a])
        return self.data[a]

    def unite(self, a: int, b: int) -> bool:
        pa = self.root(a)
        pb = self.root(b)
        if pa == pb: return False
        if self.data[pa] > self.data[pb]:
            pa, pb = pb, pa
        self.data[pa] += self.data[pb] # pa を pb をつなげる
        self.data[pb] = pa
        self.nexts[pa], self.nexts[pb] = self.nexts[pb], self.nexts[pa]
        return True

    def is_same(self, a: int, b: int) -> bool:
        return self.root(a) == self.root(b)

    def size(self, a: int) -> int:
        """a が属する集合のサイズ"""
        return -self.data[self.root(a)]

    def group(self, a: int):
        """a が属する集合"""
        yield a
        x = a
        while self.nexts[x] != a:
            x = self.nexts[x]
            yield x


N, M, K = map(int, input().split())
A = list(map(int, input().split()))

edges = []
for _ in range(M):
    u, v = map(lambda x: int(x)-1, input().split())
    mi = min(A[u], A[v])
    ma = max(A[u], A[v])
    edges.append((mi, ma, u, v))

t = A.copy()
uf = UnionFind(N)
for mi, ma, u, v in sorted(edges):
    ru = uf.root(u)
    rv = uf.root(v)

    d = abs(t[ru] - t[rv])
    if d <= K:
        uf.unite(ru, rv)
        r = uf.root(ru)
        t[r] = max(t[ru], t[rv])

s = set(t[uf.root(i)] for i in range(N))
if len(s) == 1:
    print('Yes')
else:
    print('No')