#include<bits/stdc++.h>
using namespace std;
const int N=2e6+5;
int n,m,k,x[N],y[N],bn[N],bm[N];
double ans;
struct P{
    int dis,i,j;
    bool operator < (const P&t)const{
        if(dis!=t.dis)return dis<t.dis;
        if(i!=t.i)return i<t.i;
        return j<t.j;
    }
}a[N];
int dis(int x,int y,int u,int v){
    return (x-u)*(x-u)+(y-v)*(y-v);
}
void slv(){
    int l=0;
    for(int i=1;i<=m;++i){
        bm[i]=0;
        int u,v;
        scanf("%d %d",&u,&v);
        for(int j=1;j<=n;++j){
            a[++l]=(P){dis(u,v,x[j],y[j]),j,i};
        }
    }
    for(int i=1;i<=n;++i)bn[i]=0;
    sort(a+1,a+l+1);
    for(int i=1;i<=l;++i){
        if(bn[a[i].i]||bm[a[i].j])continue;
        bn[a[i].i]=bm[a[i].j]=1;
        // printf("___%d %d %d\n",a[i].i,a[i].j,a[i].dis);
        ans+=sqrt(a[i].dis);
    }
}
int main(){
    scanf("%d %d %d",&n,&m,&k);
    for(int i=1;i<=n;++i){
        scanf("%d %d",&x[i],&y[i]);
    }
    slv();
    m=k;
    slv();
    printf("%.10lf\n",ans);
}