#include<algorithm>
#include<cmath>
#include<cstdio>
#include<set>
#include<vector>
typedef long long ll;
typedef double real;
const int maxn=10000;
const real eps=1e-14;
int sign(const real num){
	return num<-eps?-1:num>eps;
}
struct Vector{
	real x,y;
	Vector(){}
	Vector(const real x,const real y):x(x),y(y){}
	void input(){
		scanf("%lf%lf",&x,&y);
	}
	friend Vector operator-(const Vector&A,const Vector&B){
		return Vector(A.x-B.x,A.y-B.y);
	}
	friend real Dot(const Vector&A,const Vector&B){
		return A.x*B.x+A.y*B.y;
	}
	friend real Cross(const Vector&A,const Vector&B){
		return A.x*B.y-A.y*B.x;
	}
	real Length(){
		return hypot(x,y);
	}
	real Length2(){
		return x*x+y*y;
	}
	Vector rotate(const real _cos_,const real _sin_){
		return Vector(x*_cos_-y*_sin_,y*_cos_+x*_sin_);
	}
};
struct Segment{
	Vector A,B;
	real k,b;
}S[maxn];
Vector L1,L2;
int n;
real L,L_len,L_len2,_cos_,_sin_,s,t,cur_val,cur_sum,ans;
struct Query{
	int type,id;
	real pos;
	Query(const int type,const int id,const real pos):type(type),id(id),pos(pos){};
	friend bool operator<(const Query&A,const Query&B){
		return sign(A.pos-B.pos)?A.pos<B.pos:(A.type&1)>(B.type&1);
	}
};
std::vector<Query>Q;
struct cmp_s{
	bool operator()(const int u,const int v){
		return S[u].k*s+S[u].b<S[v].k*s+S[v].b;
	}
};
std::set<int,cmp_s>set_s_u,set_s_d;
struct cmp_t{
	bool operator()(const int u,const int v){
		return S[u].k*t+S[u].b<S[v].k*t+S[v].b;
	}
};
std::set<int,cmp_t>set_t_u,set_t_d;
void solve(){
	scanf("%d",&n);
	for(int i=0;i<n;i++)S[i].A.input(),S[i].B.input();
	L1.input(),L2.input();
	scanf("%lf",&L);
	for(int i=0;i<n;i++)S[i].A=S[i].A-L1,S[i].B=S[i].B-L1;
	L2=L2-L1,L1=Vector(0,0);
	L_len2=L2.Length2(),L_len=sqrt(L_len2),L/=L_len,_cos_=L2.x/L_len2,_sin_=-L2.y/L_len2;
	for(int i=0;i<n;i++)S[i].A=S[i].A.rotate(_cos_,_sin_),S[i].B=S[i].B.rotate(_cos_,_sin_);
	L1=L1.rotate(_cos_,_sin_),L2=L2.rotate(_cos_,_sin_);
	Q.clear();
	for(int i=0;i<n;i++){
		if(S[i].A.x>S[i].B.x)std::swap(S[i].A,S[i].B);
		S[i].k=(S[i].B.y-S[i].A.y)/(S[i].B.x-S[i].A.x);
		S[i].b=S[i].A.y-S[i].k*S[i].A.x;
		Q.emplace_back(0,i,S[i].A.x);
		Q.emplace_back(1,i,S[i].B.x);
		Q.emplace_back(2,i,S[i].A.x+L);
		Q.emplace_back(3,i,S[i].B.x+L);
	}
	std::sort(Q.begin(),Q.end());
	t=-1e10,s=t-L,cur_val=0,cur_sum=0,ans=0;
	for(size_t i=0,j;i<Q.size();i=j){
		cur_sum+=(Q[i].pos-t)*cur_val;
		for(j=i;j<Q.size()&&Q[j].pos<Q[i].pos+eps;j++){
			const int type=Q[j].type,id=Q[j].id;
			if((type&1)==0)t=Q[i].pos,s=t-L;
			if(type==0){
				if(S[id].A.y>0)set_t_u.emplace(id);
				else set_t_d.emplace(id);
			}else if(type==1){
				if(S[id].A.y>0)set_t_u.erase(id);
				else set_t_d.erase(id);
			}else if(type==2){
				if(S[id].A.y>0)set_s_u.emplace(id);
				else set_s_d.emplace(id);
			}else if(type==3){
				if(S[id].A.y>0)set_s_u.erase(id);
				else set_s_d.erase(id);
			}
		}
		t=Q[i].pos,s=t-L;
		cur_val=0;
		cur_val+=(set_t_u.empty()?0:hypot(S[*set_t_u.begin()].k,1))+(set_t_d.empty()?0:hypot(S[*set_t_d.rbegin()].k,1));
		cur_val-=(set_s_u.empty()?0:hypot(S[*set_s_u.begin()].k,1))+(set_s_d.empty()?0:hypot(S[*set_s_d.rbegin()].k,1));
		ans=std::max(ans,cur_sum);
	}
	printf("%.10lf\n",ans*L_len);
}
int main(){
	int T;
	scanf("%d",&T);
	while(T--)solve();
	return 0;
}