#pragma GCC target ("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define C complex<ld>
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)
#define rep(i,n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define pb emplace_back
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-b.begin()
#define ssp(i,n) (i==(int)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) int quetimes_=(n);rep(qq123_,quetimes_)
#define gcj printf("Case #%lld: ",qq123_+1)
#define readv(a,n) a.resize(n,0);rep(i,(n)) a[i]=read()
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
bool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p = mod) {
    ll res = 1; x %= p;
    while (n > 0) {
        if (n & 1) res = res * x % p;
        x = x * x % p;
        n >>= 1;
    }
    return res;
}//x^n%p
ll bitcount(ll x) {
    int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
    return sum;
}
/*constexpr int fn_ = 5000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll m) {
    if (!fact_[0]) {
        fact_[0] = 1; comp_[0] = 1;
        for (int i = 1; i < fn_; i++)
            fact_[i] = fact_[i - 1] * i % m;
        comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], m - 2, m);
        for (int i = fn_ - 2; i > 0; i--)
            comp_iiiiiiiiiiiijijiii[i] = comp_[i + 1] * (i + 1) % m;
    }
    if (x < y) return 0;
    return fact_[x] * comp_[x - y] % m * comp_[y] % m;
}*/
//--------------------------------------------------------------
struct edg {
    int to; ld cost;
    bool operator<(edg a) const{ return cost < a.cost; }
    bool operator>(edg a) const{ return cost > a.cost; }
};
struct path {
    ld cst;
    vec<int>v;
    bool operator<(const path p) const{ return cst < p.cst; }
};
int n, m, k;
int st, ed;
C d[3000];
vec<edg>e[3000];
vec<edg>f[3000];
vec<edg>h[3000];
ld c[3000];
void dijk(int st, int ed) {
    priority_queue<edg, vec<edg>, greater<edg>>p;
    rep(i, n) if (i != st) c[i] = inf;
    p.push(edg{ st,0 });
    while (!p.empty()) {
        edg t = p.top(); p.pop();
        for (auto g : e[t.to]) {
            if (c[g.to] > c[t.to] + g.cost) {
                c[g.to] = c[t.to] + g.cost;
                p.push(edg{ g.to,c[g.to] });
            }
        }
    }
}
vec<int>patt(int st, int ed) {
    int pos = ed;
    vec<int>tmp;
    while (pos != st) {
        tmp.pb(pos);
        for (auto g : f[pos]) {
            if (c[g.to] == c[pos] + g.cost) {
                pos = g.to;
                break;
            }
        }
    }
    tmp.pb(st);
    reverse(all(tmp));
    return tmp;
}
signed main() {
    cin >> n >> m >> k >> st >> ed;
    st--; ed--;
    rep(i, n) {
        int u, v; cin >> u >> v;
        d[i] = C( u,v );
    }
    rep(i, m) {
        int u, v; cin >> u >> v;
        u--; v--;
        e[u].pb(edg{ v,abs(d[u] - d[v]) });
        e[v].pb(edg{ u,abs(d[u] - d[v]) });
        f[u].pb(edg{ v,abs(d[u] - d[v]) });
        f[v].pb(edg{ u,abs(d[u] - d[v]) });
    }
    vec<path> a,b;
    a.pb(path{ c[ed],patt(st,ed) });
    rep(z, k - 1) {
        vec<int>pre = a.back().v;
        rep(i, pre.size()-1) {
           rep(i, n) e[i] = f[i];
            for (auto gg : a) {
                vec<int>rt = gg.v;
                rep(j, min((ll)rt.size(),i + 1)) {
                    if (pre[j] != rt[j]) {
                        goto loop;
                    }
                }
                for (auto& g : e[pre[i]]) {
                    if (g.to == pre[i + 1]) g.cost = inf;
                }
            loop:;
            }
            dijk(pre[i], ed);
            vec<int>tmp;
            rep(j, i + 1) tmp.pb(pre[j]);
            vec<int>kk = patt(pre[i], ed);
            rep(j, kk.size()) tmp.pb(kk[j]);
            ld sum = 0;
            for (auto gg : b) {
                if (gg.v == tmp) goto roop;
            }
            rep(i, tmp.size() - 1) {
                for (auto g : e[tmp[i]]) {
                    if (g.to == tmp[i + 1]) {
                        sum += g.cost;
                        break;
                    }
                }
            }
            b.pb(path{ sum,tmp });
        roop:;
        }
        auto it = b.begin();
        for(auto it2=b.begin();it2!=b.end();it2++) {
            if ((*it).cst > (*it2).cst) it = it2;
        }
        a.pb(*it);
        b.erase(it);
    }
    cout << a.back().cst << endl;
}