#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
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 (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

using P = pair<double, int>;

vector<vector<P>> G;
int k;


using bit = bitset<2000>;
using PP = pair<double, pair<pii, bit>>;
class Cmp {
public:
	bool operator() (PP a, PP b) {
        return a.first < b.first;
	}
};

vector<set<pair<double, int>>> dijkstra(int s, int n){
	priority_queue<PP, vector<PP>, Cmp > pq;
    // priority_queue<PP, vector<PP>, greater<PP> > pq;
	int i;
    int hash = 0;
	vector<set<pair<double, int>>> d(n);
	d[s].insert({0, hash});
    bit temp = bit();
    temp[s] = true;
	pq.push(PP(0, {pii(s, hash++), temp}));
	
	while(!pq.empty()){
		PP f=pq.top();
        // DEBUG(f);
		pq.pop();
		int u=f.second.first.first, nowhash = f.second.first.second;
        bit mask = f.second.second;
        double cost = f.first;
        if (not d[u].count({cost, nowhash})) continue;
		for (i = 0; i < G[u].size(); i++) {
            int v = G[u][i].second;
            double ncost = cost + G[u][i].first;
            if (mask[v]) continue;
            if (d[v].size() == k) {
                auto itr = d[v].end();
                itr--;
                if (itr->first <= ncost) continue;
                d[v].erase(itr);
            }
            d[v].insert({ncost, hash});
            bit nmask = mask;
            nmask[v] = true;
            pq.push({ncost, {pii(v, hash++), nmask}});
		}
	}
    return d;
}


signed main() {
    int n, m;
    cin >> n >> m >> k;
    G.resize(n);
    int x, y;
    cin >> x >> y;
    x--; y--;
    vector<pii> xy(n);
    rep (i, n) {
        cin >> xy[i].first >> xy[i].second;
    }
    rep (i, m) {
        int u, v;
        cin >> u >> v;
        u--; v--;
        pii xy1 = xy[u], xy2 = xy[v];
        double dist = sqrt((xy1.first - xy2.first) * (xy1.first - xy2.first) + (xy1.second - xy2.second) * (xy1.second - xy2.second));
        G[u].push_back(P(dist, v));
        G[v].push_back(P(dist, u));
    }
    auto dist = dijkstra(x, n);
    
    for (auto itr = dist[y].begin(); itr != dist[y].end(); itr++) {
        Sp(itr->first);
        k--;
    }
    while (k--) {
        cout << -1 << endl;
    }
}