#include<bits/stdc++.h>
#define ld double
#define ll long long
using namespace std;
const int MAXN=5005;
const ll inf=2.5e18;
int n,m; ll k;
vector <int> G[MAXN];
struct graph {
	int s,t,d[MAXN];
	bool vis[MAXN];
	bitset <MAXN> f[MAXN];
	vector <int> ord;
	int bfs() {
		queue <int> q;
		memset(d,0x3f,sizeof(d));
		q.push(s),d[s]=0;
		while(q.size()) {
			int u=q.front(); q.pop();
			ord.push_back(u),f[u][u]=1;
			for(int v:G[u]) {
				if(d[v]>d[u]+1) {
					d[v]=d[u]+1,q.push(v),f[v]=f[u];
				} else if(d[v]==d[u]+1) f[v]|=f[u];
			}
		}
		return d[t];
	}
}	X,Y;
ll q1(ll x) {
	ll z=sqrt(x)+10;
	while(z*(z-1)>x) --z;
	return z;
}
ll q2(ll x) {
	ll z=sqrt(2*x)+10;
	while(z*(z-1)/2>x) --z;
	return z;
}
signed main() {
	scanf("%d%d%lld",&n,&m,&k);
	for(int i=1,u,v;i<=m;++i) scanf("%d%d",&u,&v),G[u].push_back(v),G[v].push_back(u);
	scanf("%d%d%d%d",&X.s,&X.t,&Y.s,&Y.t);
	int z=0,x=X.bfs(),y=Y.bfs();
	for(int i=1;i<=n;++i) for(int j=1;j<=n;++j) {
		bool fx=X.f[i][X.s]&&X.f[j][i]&&X.f[X.t][j];
		bool fy=Y.f[i][Y.s]&&Y.f[j][i]&&Y.f[Y.t][j];
		fy|=Y.f[j][Y.s]&&Y.f[i][j]&&Y.f[Y.t][i];
		if(fx&&fy) z=max(z,X.d[j]-X.d[i]);
	}
	if(!x&&!y&&!z) return puts("0"),0;
	ll l=1,r=inf,p=0;
	while(l<=r) {
		ll mid=(l+r)>>1;
		if((q2(mid)-1)*z+(q1(mid)-1)*(x+y-2*z)<=k) l=mid+1,p=mid;
		else r=mid-1;
	}
	ll s1=q1(p),s2=q2(p),q=k-(s2-1)*z-(s1-1)*(x+y-2*z);
	cerr<<x<<" "<<y<<" "<<z<<" "<<s1<<" "<<s2<<" "<<p<<" "<<q<<"\n";
	ll c1=(s1+1)*s1,c2=(s2+1)*s2/2;
	if(c1<c2) {
		printf("%.16lf",(ld)q/(s1+1)+(ld)(x+y-2*z-q)/s1+(ld)z/s2*2);
	} else if(c2<c1||q<=z) {
		printf("%.16lf",(ld)(x+y-2*z)/s1+((ld)(z-q)/s2+(ld)q/(s2+1))*2);
	} else {
		q-=z;
		printf("%.16lf",(ld)q/(s1+1)+(ld)(x+y-2*z-q)/s1+(ld)z/(s2+1)*2);
	}
	return 0;
}