#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <numeric>
#include <cmath>
#include <iomanip> //cout << fixed << setprecision(15) << << endl;
#include <cassert>
#include <limits>
//#include "atcoder/all"

using namespace std;
//using namespace atcoder;

#define ll long long int
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
//#define P pair<int,int>

int mx8[] = {0,0,1,-1,-1,1,-1,1};
int my8[] = {-1,1,0,0,-1,-1,1,1};
int mx4[] = {1,-1,0,0};
int my4[] = {0,0,-1,1};


template<typename T>
class Graph
{
public:
    struct Edge
    {
        int to;
        T cost;
    };
    struct edge
    {
        int from;
        int to;
    };
    vector<vector<Edge>> g;
    vector<edge> edges;
    int n;
    Graph(int n)
            :n(n)
    {
        g.resize(n);
    }
    void Add(int from, int to, T cost)
    {
        g[from].push_back({to, cost});
        g[to].push_back({from, cost});
    }
    void Add_Edge(int from, int to)
    {
        edges.push_back({from, to});
    }
};

template<typename T>
vector<T> dijkstra(const Graph<T> &g, int start)
{
    using P = pair<T, int>;
    vector<T> dist(g.n, numeric_limits<T>::max());
    priority_queue<P, vector<P>, greater<P>> pq;
    dist[start] = 0;
    pq.push({dist[start], start});
    while (!pq.empty())
    {
        T expected = pq.top().first;
        int i = pq.top().second;
        pq.pop();
        if (dist[i] != expected)
        {
            continue;
        }
        for (auto e : g.g[i])
        {
            int j = e.to;
            T c = e.cost;
            if (dist[j] > dist[i] + c)
            {
                dist[j] = dist[i] + c;
                pq.push({dist[j], j});
            }
        }
    }
    return dist;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    int x, y;
    cin >> x >> y;
    --x;
    --y;
    vector<int> p(n), q(n);
    for (int i = 0; i < n; ++i)
    {
        cin >> p[i] >> q[i];
    }
    Graph<double> g(n);
    for (int i = 0; i < m; ++i)
    {
        int u, v;
        cin >> u >> v;
        --u;
        --v;
        double dist = sqrt((p[u] - p[v]) * (p[u] - p[v]) + (q[u] - q[v]) * (q[u] - q[v]));
        g.Add(u, v, dist);
    }
    vector<double> dist = dijkstra(g, x);
    cout << fixed << setprecision(17) << dist[y] << '\n';
    return 0;
}