from heapq import heappush, heappop N, M, S, T = map(int, input().split()) S -= 1 T -= 1 P = list(map(int, input().split())) G = [list() for _ in range(N)] for i in range(M): u, v = map(int, input().split()) u -= 1 v -= 1 G[u].append(v) G[v].append(u) visited = [False]*N que = [] heappush(que, (-P[S], S)) # 人口、pos min_p = 10**18 ans = -1 while que: p, pos = heappop(que) p *= -1 if p < min_p: ans += 1 min_p = p if visited[pos]: continue visited[pos] = True for nex in G[pos]: if visited[nex]: continue heappush(que, (-P[nex], nex)) print(ans)