#include<cstdio>
#include<iostream>
#include<fstream>
#include<vector>
#include<cmath>

using namespace std;

vector<double>t;
vector< vector<double> > tt;
vector<int> p;
int n,h;
int bestwin = 0;


void search(int top, int win) {
	if(top<n) {
		if ( win+n-top < bestwin ) return;

		for(int i = 0; i < h; ++i) {
			if ( t[p[i]]+tt[p[i]][top] <= t[top] ) {
				int tmp = p[i];
				p[i] = top;
				search(top+1,win+1);
				p[i] = tmp;
			}
		}
		search(top+1,win);
	}
	else
	{
		if ( win > bestwin ) {
			bestwin = win;
		}
	}
}

int main(int argc, const char* argv[])
{
	int K;
	vector<double> x,y,x0,y0;
	double u,v;
	ifstream inf("hare.in");
	inf>>K;
	for(int i = 0; i < K; ++i) {
		inf>>n>>h>>u>>v;
		x.resize(n); y.resize(n); x0.resize(h); y0.resize(h); 
		t.resize(n+h); tt.assign(n+h,vector<double>(n,0));

		double tmpx = 0,tmpy = 0,tmpt = 0;
		for(int j = 0;j < n; ++j) { 
			inf>>x[j]>>y[j]; 
			t[j] = sqrt((x[j]-tmpx)*(x[j]-tmpx)+(y[j]-tmpy)*(y[j]-tmpy))/u+tmpt;
			tmpx=x[j];tmpy=y[j];tmpt=t[j];
		}
		for(int j = 0;j < h; ++j) t[n+j] = 0;

		x0[0]=y0[0] = 0;
		for(int j = 1;j <h; ++j) inf>>x0[j]>>y0[j];

		for(int j = 0; j < n; ++j) {
			for(int k = 0; k < n; ++k) {
				tt[j][k] = sqrt((x[j]-x[k])*(x[j]-x[k])+(y[j]-y[k])*(y[j]-y[k]))/v;
			}
			for(int k = 0; k < h; ++k) {
				tt[n+k][j] = sqrt((x[j]-x0[k])*(x[j]-x0[k])+(y[j]-y0[k])*(y[j]-y0[k]))/v;
			}
		}

		p.resize(h); for(int j = 0; j < h; ++j) p[j] = n+j;
		bestwin = 0;
		search(0,0);

		cout<<"Data Set "<<i+1<<":"<<endl<<bestwin<<endl<<endl;
	}
	return 0;
}