#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <limits>
#include <iomanip>
using namespace std;

struct point {
	double x, y;
	point(double _x=0, double _y=0): x(_x), y(_y) {}
};

inline double dist(const point &a, const point &b)
{ return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)); }

double calpenality(const vector<point> &rgz, int bits, double a, double b) {
	bitset<11> ison(bits);
	double penality = 0;
	for (unsigned int i = 0; i < rgz.size(); ++i) {
		for (unsigned int j = i+1; j < rgz.size(); ++j) {
			if (ison[i] == ison[j]) {
				penality += a*dist(rgz[i], rgz[j]);
			} else {
				penality += -b*dist(rgz[i], rgz[j]);
			}
		}
	}
	return penality;
}

double calchange(int numa, int numb, double c) {
	const bitset<11> a(numa), b(numb);
	double penality = 0;
	for (unsigned int i = 0; i < a.size(); ++i)
		if (a[i] != b[i])
			penality += c;
	return penality;
}

int main(int, char**) {
	ifstream ifile("zebras.in");
	int K;
	ifile>>K;
	for (int cset = 1; cset <= K; ++cset) {
		int cz, t;
		ifile>>cz>>t;
		double a, b, c;
		ifile>>a>>b>>c;
		vector< vector<point> > rgz(t, vector<point>(cz));
		for (int ixt = 0; ixt < t; ++ixt)
			for (int ixz = 0; ixz < cz; ++ixz)
				ifile>>rgz[ixt][ixz].x>>rgz[ixt][ixz].y;
		// dp
		vector< vector<double> > dp(t, vector<double>(1<<cz, numeric_limits<double>::max()));
		vector< vector<double> > basepenality(t, vector<double>(1<<cz, 0));
		for (int ixt = 0; ixt < t; ++ixt) {
			for (unsigned int ixz = 0; ixz < basepenality[ixt].size(); ++ixz) {
				basepenality[ixt][ixz] = calpenality(rgz[ixt], ixz, a, b);
			}
		}
		for (unsigned int ixz = 0; ixz < dp[0].size(); ++ixz) {
			dp[0][ixz] = basepenality[0][ixz];
			// cerr<<dp[0][ixz]<<' ';
		}
		vector< vector<double> > changepenality(1<<cz, vector<double>(1<<cz, 0));
		for (int i = 0; i < changepenality.size(); ++ i)
			for (int j = i+1; j < changepenality.size(); ++j)
				changepenality[i][j] = changepenality[j][i] = calchange(i, j, c);
		// cerr<<endl;
		for (int ixt = 1; ixt < t; ++ixt) {
			for (int ixbin = 0; ixbin < dp[ixt].size(); ++ixbin) {
				for (int newixbin = 0; newixbin < dp[ixt].size(); ++newixbin)
					dp[ixt][ixbin] = min(dp[ixt][ixbin],
						basepenality[ixt][ixbin]+dp[ixt-1][newixbin]+changepenality[ixbin][newixbin]);
			}
		}
		// output
		cout<<"Data Set "<<cset<<':'<<endl;
		cout<<fixed<<setprecision(2)<<*min_element(dp.back().begin(), dp.back().end())<<endl<<endl;
	}
}