import sys
input=lambda: sys.stdin.readline().rstrip()
n,m=map(int,input().split())
x,y=map(int,input().split())
PQ=[tuple(int(i) for i in input().split()) for _ in range(n)]

def f(A,B):
  a1,a2=A
  b1,b2=B
  return ((a1-b1)**2+(a2-b2)**2)**0.5

edge=[[] for i in range(n)]
for _ in range(m):
  p,q=map(int,input().split())
  dis=f(PQ[p-1],PQ[q-1])
  edge[p-1].append([dis,q-1])
  edge[q-1].append([dis,p-1])

import heapq
def dijkstra_heap(s):
  d=[float("inf")]*n
  used=[True]*n
  d[s]=0
  used[s]=False
  edgelist=[]
  for e in edge[s]:
    heapq.heappush(edgelist,e)
  while edgelist:
    minedge = heapq.heappop(edgelist)
    if not used[minedge[1]]:
      continue
    v = minedge[1]
    d[v] = minedge[0]
    used[v] = False
    for e in edge[v]:
      if used[e[1]]:
        heapq.heappush(edgelist,[e[0]+d[v],e[1]])
  return d
print(dijkstra_heap(x-1)[y-1])