#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
using Pd=pair<double, int>;
int n, m, k;
vector<P> g[200020];
double de[200020];
const double INF=1e18;
bool dame[200020];
bool damee[200020];
int p[200020], q[200020];
pair<double, vector<int>> dijkstra(int s, int t){
	priority_queue<Pd, vector<Pd>, greater<Pd>> que;
	double d[2020];
	int pr[2020];
	fill(d, d+n, INF);
	d[s]=0;
	que.push({0, s});
	while(!que.empty()){
		auto p=que.top(); que.pop();
		int x=p.second;
		if(d[x]<p.first) continue;
		for(auto q:g[x]){
			int y=q.first;
			if(dame[y] || damee[q.second]) continue;
			if(d[y]>d[x]+de[q.second]){
				d[y]=d[x]+de[q.second];
				que.push({d[y], y});
				pr[y]=q.second;
			}
		}
	}
	vector<int> ret;
	if(d[t]>=INF/2){
		return make_pair(INF, ret);
	}
	int z=t;
	while(z!=s){
		ret.push_back(pr[z]);
		if(p[pr[z]]==z) z=q[pr[z]];
		else z=p[pr[z]];
	}
	reverse(ret.begin(), ret.end());
	return make_pair(d[t], ret);
}
int main()
{
	cin>>n>>m>>k;
	int x, y; cin>>x>>y; x--; y--;
	double a1[200020], b1[200020];
	for(int i=0; i<n; i++) cin>>a1[i]>>b1[i];
	for(int i=0; i<m; i++){
		cin>>p[i]>>q[i];
		p[i]--; q[i]--;
		de[i]=sqrt((a1[p[i]]-a1[q[i]])*(a1[p[i]]-a1[q[i]])+(b1[p[i]]-b1[q[i]])*(b1[p[i]]-b1[q[i]]));
		g[p[i]].push_back({q[i], i});
		g[q[i]].push_back({p[i], i});
	}
	double ans[11];
	auto p0=dijkstra(x, y);
	vector<int> a[11];
	vector<pair<double, vector<int>>> b;
	a[0]=p0.second;
	ans[0]=p0.first;
	int k0=k;
	for(int i=1; i<k; i++){
		int z=x;
		vector<int> v;
		double d0=0;
		for(int j=0; j<a[i-1].size(); j++){
			int w;
			if(p[a[i-1][j]]==z) w=q[a[i-1][j]];
			else w=p[a[i-1][j]];
			vector<int> myon;
			for(int l=0; l<i; l++){
			    if(a[l].size()<=j) continue;
				bool same=1;
				for(int m=0; m<j; m++){
					if(a[i-1][m]!=a[l][m]){
						same=0; break;
					}
				}
				if(same){
					damee[a[l][j]]=1;
					myon.push_back(a[l][j]);
				}
			}
			auto r=dijkstra(z, y);
			if(r.first<INF/2){
				vector<int> nuo;
				for(int l=0; l<j; l++) nuo.push_back(a[i-1][l]);
				for(auto e:r.second) nuo.push_back(e);
				b.push_back(make_pair(r.first+d0, nuo));
			}
			for(auto f:myon) damee[f]=0;
			dame[z]=1;
			d0+=de[a[i-1][j]];
			v.push_back(z);
			z=w;
		}
		if(b.empty()){
			k0=i; break;
		}
		sort(b.begin(), b.end(), greater<pair<double, vector<int>>>());
		b.erase(unique(b.begin(), b.end()), b.end());
		a[i]=b.back().second; ans[i]=b.back().first; b.pop_back();
		for(auto u:v) dame[u]=0;
	}
	for(int i=0; i<k; i++){
		if(i<k0) printf("%.12lf\n", ans[i]);
		else printf("-1\n");
	}
	return 0;
}