#include <iostream>
#include <math.h>
using namespace std;

static int N = 0;
static int M = 0;

typedef struct Building{
    double x;
    double y;
    int adjacent[500];
    int adjacent_count;
}build;

static build buildings[500] = {0, };
static build spannings[500] = {0, };
static int spanning_count = 0;
static int close_building[500] = {0, };

double Sqaure(double value){
    return value * value;
}
double Dist(double x_dist, double y_dist){
    return sqrt(Sqaure(x_dist) + Sqaure(y_dist));
}

void Link(int idx){
    spannings[spanning_count++] = buildings[idx];
    close_building[idx] = 1;
    for(int i=0; i<buildings[idx].adjacent_count; i++){
        if(close_building[buildings[idx].adjacent[i]] == 1)
            continue;
        Link(buildings[idx].adjacent[i]);
    }
}

double length = 0;
void LAN(){
    int close_count = 0;
    while(close_count < N && close_building[close_count] == 1)
        close_count++;
    if(close_count == N)
        return ;

    double min_dist = 987654321;
    int min_dist_idx = 0;
    for(int i=0; i<spanning_count; i++){
        for(int j=0; j<N; j++){
            if(close_building[j] == 1)
                continue;
            double dist = Dist(spannings[i].x - buildings[j].x, spannings[i].y - buildings[j].y);
            if(dist < min_dist){
                min_dist = dist;
                min_dist_idx = j;
            }
        }
    }
    Link(min_dist_idx);
    length += min_dist;
    LAN();
}

void Init(){
    for(int i=0; i<N; i++){
        buildings[i].adjacent_count = 0;
        spannings[i].adjacent_count = 0;
        close_building[i] = 0;
    }
    spanning_count = 0;
    length = 0;
}

int main(void){
    int C=0;
    cin>>C;
    while(C-->0){
        Init();
        cin>>N>>M;

        for(int i=0; i<N; i++)
            cin>>buildings[i].x;
        for(int i=0; i<N; i++)
            cin>>buildings[i].y;

        for(int i=0; i<M; i++){
            int build_a, build_b;
            cin>>build_a>>build_b;

            buildings[build_a].adjacent[buildings[build_a].adjacent_count++] = build_b;
            buildings[build_b].adjacent[buildings[build_b].adjacent_count++] = build_a;
        } 

        Link(0);
        LAN();
        cout.precision(10);
        cout<<length<<endl;
    }
    return 0;
}