"""

https://yukicoder.me/problems/no/3093

一番下からの引き上げは必須
最小値から周りを見て引き上げる…

あー縮約が必須なのか・・・
大 -> 小も見るからなんとかなりそうだが…



"""


class DSU():

    def __init__(self, n:int):

        self.n = n
        self.p = [i for i in range(n)]
        self.rank = [i for i in range(n)]
        self.sizelis = [1] * n

    def leader(self,a):
        stk = []
        while self.p[a] != a:
            stk.append(a)
            a = self.p[a]
        for v in stk:
            self.p[v] = a
        return a

    def merge(self, a, b):
        ap = self.leader(a)
        bp = self.leader(b)
        if ap == bp:
            return ap

        if self.rank[ap] > self.rank[bp]:
            self.p[bp] = ap
            self.sizelis[ap] += self.sizelis[bp]
        elif self.rank[ap] < self.rank[bp]:
            self.p[ap] = bp
            self.sizelis[bp] += self.sizelis[ap]
        else:
            self.p[bp] = ap
            self.sizelis[ap] += self.sizelis[bp]
            self.rank[ap] += 1
        return self.p[ap]

    def same(self,a,b):
        return self.leader(a) == self.leader(b)

    def size(self,a):
        return self.sizelis[ self.leader(a) ]

    def groups(self):
        dic = {}
        for v in range(self.n):
            vp = self.leader(v)
            if vp not in dic:
                dic[vp] = [v]
            else:
                dic[vp].append(v)
        return list(dic.values())


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

lis = [ [] for i in range(N) ]

for i in range(M):
    u,v = map(int,input().split())
    u -= 1; v -= 1
    lis[u].append(v)
    lis[v].append(u)

B = [i for i in A]
ai = [ (A[i],i) for i in range(N) ]
ai.sort()

uf = DSU(N)

for na,v in ai:

    vp = uf.leader(v)

    for nex in lis[v]:
        nexp = uf.leader(nex)
        if abs( A[nex]-B[vp] ) <= K or abs( B[nexp]-A[v] ) <= K:
            uf.merge( vp,nexp )
            B[vp] = B[nexp] = max(B[vp],B[nexp] )

if uf.size(0) == N:
    print ("Yes")
else:
    print ("No")