SPFA + 點到線的最短距離
//
// GGGGGGGGGGGGG CCCCCCCCCCCCC AAA
// GGG::::::::::::G CCC::::::::::::C A:::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::::A
// G:::::G GGGGGG C:::::C CCCCCC A:::::::::A
//G:::::G C:::::C A:::::A:::::A
//G:::::G C:::::C A:::::A A:::::A
//G:::::G GGGGGGGGGGC:::::C A:::::A A:::::A
//G:::::G G::::::::GC:::::C A:::::A A:::::A
//G:::::G GGGGG::::GC:::::C A:::::AAAAAAAAA:::::A
//G:::::G G::::GC:::::C A:::::::::::::::::::::A
// G:::::G G::::G C:::::C CCCCCC A:::::AAAAAAAAAAAAA:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::A A:::::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A A:::::A
// GGG::::::GGG:::G CCC::::::::::::C A:::::A A:::::A
// GGGGGG GGGG CCCCCCCCCCCCCAAAAAAA AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 55
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
clock_t start_time=clock(), end_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
struct point{
double x,y;
point(){
x=y=oo;
}
point operator+(point d){
point ans;
ans.x=x+d.x;
ans.y=y+d.y;
return ans;
}
point(double x,double y):x(x),y(y){};
};
struct vec{
double x,y;
vec(double x,double y):x(x),y(y){};
double operator%(vec d){
return (x*d.x+y*d.y);
}
double operator*(vec d){
return (x*d.y-y*d.x);
}
double length(){
return sqrt(x*x+y*y);
}
double NormalSqr(){
return x*x+y*y;
}
};
vec toVector(point p1,point p2){
return vec(p2.x-p1.x,p2.y-p1.y);
}
vec scaleVector(vec v,double s){
return vec(v.x*s,v.y*s);
}
point translate(point p,vec v){
return point(p.x+v.x,p.y+v.y);
}
double dist(point a,point b){
//return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
return hypot(a.x-b.x,a.y-b.y);
}
double distToLine(point o,point a,point b,point &LineP){
vec ao=toVector(a,o),ab=toVector(a,b);
double u=(ao%ab)/ab.NormalSqr();
// debug("%lf\\n",u);
LineP=translate(a,scaleVector(ab,u));
return dist(LineP,o);
}
double distToLineSegment(point o,point a,point b,point &LineP){
vec ao=toVector(a,o),ab=toVector(a,b);
double u=(ao%ab)/ab.NormalSqr();
if(u<0.0){
LineP=point(a.x,a.y);
return dist(o,a);
}
if(u>1.0){
LineP=point(b.x,b.y);
return dist(o,b);
}
return distToLine(o,a,b,LineP);
}
int r1,r2,landn;
vector<point> land[16];
double mz[20][20];
double mindist(int x,int y){
double minn=oo;point pnull;
for(int i=0;i<land[x].size();i++){
for(int j=0;j<land[y].size()-1;j++){
double t=distToLineSegment(land[x][i],land[y][j],land[y][j+1],pnull);
minn=min(t,minn);
}
}
for(int i=0;i<land[x].size()-1;i++){
for(int j=0;j<land[y].size();j++){
double t=distToLineSegment(land[y][j],land[x][i],land[x][i+1],pnull);
minn=min(t,minn);
}
}
return minn;
}
void solve(){
fill(&mz[0][0],&mz[19][19],oo);
for(int i=0;i<landn;i++){
for(int j=i+1;j<landn;j++){
mz[i][j]=mz[j][i]=mindist(i,j);
// debug("%d %d %lf\\n",i,j,mz[i][j]);
}
}
bool inq[20]={};
double dist[20];
queue<int> q;
fill(&dist[0],&dist[19],oo);
dist[0]=0;
inq[0]=1;
q.push(0);
while(!q.empty()){
int x=q.front();
q.pop();
for(int i=0;i<landn;i++){
if(dist[x]+mz[x][i]<dist[i]){
dist[i]=dist[x]+mz[x][i];
// debug("%d %lf\\n",i,dist[i]);
if(!inq[i]){
q.push(i);
}
}
}
inq[x]=0;
}
printf("%.3f\\n",dist[1]);
}
int main() {
ios_base::sync_with_stdio(0);
int test;
scanf("%d",&test);
while(test--){
scanf("%d%d%d",&r1,&r2,&landn);
for(int i=0;i<r1;i++){
double x,y;
scanf("%lf%lf",&x,&y);
land[0].PB(point(x,y));
}
for(int i=0;i<r2;i++){
double x,y;
scanf("%lf%lf",&x,&y);
land[1].PB(point(x,y));
}
for(int i=2;i<landn+2;i++){
int m;
scanf("%d",&m);
bool f=true;
point lp;
while(m--){
double x,y;
scanf("%lf%lf",&x,&y);
land[i].PB(point(x,y));
if(f){lp=point(x,y);f=false;}
}
land[i].PB(lp);
}
landn+=2;
solve();
for(int i=0;i<landn;i++)land[i].clear();
}
}