#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;
typedef long long ll;
typedef long double ldb;
typedef double db;
#define x1 xxxxx1
#define x2 xxxxx2
#define y1 yyyyy1
#define y2 yyyyy2
const int MAXN = 1e4 + 5;
const ldb eps = 1e-8;

struct Node
{
	ldb x,y;
	inline void read(void){ int x_,y_; scanf("%d%d",&x_,&y_); x=x_; y=y_;}
};
typedef Node Vec;

inline Vec mul(Vec v, const Vec &i,const Vec &j){ return (Vec){i.x * v.x + j.x * v.y, i.y * v.x + j.y * v.y};}

struct Seg
{
	Node p,q;
	ldb k,b;
	bool type;
	inline void read(void){ p.read(); q.read();}
	
	inline void calc(void)
	{
		k = (q.y-p.y) / (q.x-p.x);
		b = p.y - k * p.x;
	}
}a[MAXN];

struct Data
{
	ldb x;
	int id;
}p[MAXN*2];
inline bool cmp(const Data &p,const Data &q){ return p.x < q.x;}

int now;

struct Cmp
{
	inline bool operator () (const int x,const int y) const
	{
		return a[x].k * p[now].x + a[x].b < a[y].k * p[now].x + a[y].b;
	}
};

bool has[MAXN*2][2];
ldb q[MAXN*2][2];

void solve(void)
{
	int n;
	scanf("%d",&n);
	for(int i=1; i<=n; ++i)
		a[i].read();
	
	int sx,sy,x,y,l;
	scanf("%d%d%d%d%d",&sx,&sy,&x,&y,&l);
	
	x-=sx; y-=sy;
	for(int i=1; i<=n; ++i)
	{
		a[i].p.x -= sx; a[i].p.y -= sy;
		a[i].q.x -= sx; a[i].q.y -= sy;
	}
	
	ldb len = sqrt((ll)x*x + (ll)y*y);
	Vec ii = (Node){(ldb)x/len, (ldb)-y/len}, jj = (Node){(ldb)y/len, (ldb)x/len};
	
	for(int i=1; i<=n; ++i)
	{
		a[i].p = mul(a[i].p, ii,jj);
		a[i].q = mul(a[i].q, ii,jj);
		if(a[i].q.x < a[i].p.x) swap(a[i].p, a[i].q);
		
		if(a[i].p.y < 0)
		{
			a[i].type = 1;
			a[i].p.y = -a[i].p.y;
			a[i].q.y = -a[i].q.y;
		}
		else a[i].type = 0;
		
		a[i].calc();
	}
	
	for(int i=1; i<=n; ++i)
		p[i*2-1] = (Data){a[i].p.x, i},
		p[i*2] = (Data){a[i].q.x, -i};
	sort(p+1, p+2*n+1, cmp);
	
	static set<int,Cmp> t[2];
	static ldb sum[MAXN*2];
	
	t[0].clear(); t[1].clear();
	
	for(int &i=now=1; i<2*n; ++i)
	{
		int id = p[i].id;
		
		if(id < 0) t[a[-id].type].erase(-id);
		else t[a[id].type].insert(id);
		
		sum[i] = 0;
		for(int k=0; k<=1; ++k)
			if(t[k].size())
			{	
				has[i][k] = 1;
				
				Seg &a = ::a[*t[k].begin()];
				ldb x = p[i+1].x - p[i].x;
				ldb y = a.k * x;
				sum[i] += sqrt(x*x + y*y);
				
				q[i][k] = a.k;
			}
			else has[i][k] = 0;
	}
	
	for(int i=2; i<2*n; ++i)
		sum[i] += sum[i-1];
	
	ldb ans = 0;
	for(int i=1,j=1; i<2*n; ++i)
	{
		while(j<2*n && p[j].x - p[i].x <= l + eps) ++j;
		
		ldb now = sum[j-1 - 1] - sum[i-1];
		for(int k=0; k<=1; ++k) if(has[j-1][k])
		{
			ldb x = min(l - (p[j-1].x - p[i].x), p[j].x - p[j-1].x);
			ldb y = q[j-1][k] * x;
			now += sqrt(x*x + y*y);
		}
		ans = max(ans, now);
		
//		printf("\n%Lf %Lf\n",p[i].x,p[j].x);
//		printf("%Lf\n",now);
//		
//		printf("\n");
	}
	
	for(int i=2*n-1, j=2*n-1; i>=1; --i)
	{
		while(j>=1 && p[i+1].x - p[j].x <= l + eps) --j;
		
		ldb now = sum[i] - sum[j];
		for(int k=0; k<=1; ++k) if(has[j][k])
		{
			ldb x = min(l - (p[i+1].x - p[j+1].x), p[j+1].x - p[j].x);
			ldb y = q[j][k] * x;
			now += sqrt(x*x + y*y);
		}
		ans = max(ans, now);
		
//		printf("%Lf %Lf\n",p[j].x,p[i+1].x);
//		printf("%Lf\n",now);
//		
//		printf("\n");
	}
	
	printf("%.20lf\n",(db)ans);
}

int main(void)
{
	int T;
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}

/*
1
1
1 1 5 1
2 0 3 0 2

*/