#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<cstring>
#define int long long
using namespace std;
const int N = 1e3+5;
int t=1, n, m, p;
int a[N], mp[N][N];
double ans=0;
struct note
{
    double x, y;
} jud[N], fea[N];
struct edge
{
    int a, b;
    double l;
} d1[N];
bool cmp (edge x, edge y)
{
    if(x.l==y.l)
    {
        if(x.a==y.a)
        {
            return x.b < y.b;
        }
        return x.a < y.a;
    }
    return x.l < y.l;
}
vector<edge> vec;
bool vis[N], vis1[N];
void work(int x)
{
    vec.clear();
    memset(vis, 0, sizeof(vis));
    memset(vis1, 0, sizeof(vis1));
    memset(fea, 0, sizeof(fea));
    int cnt=0;
    for(int i=1; i<=x; i++)
    {
        cin>>fea[i].x>>fea[i].y;
    }

    cnt = 0;
    memset(vis,0,sizeof(vis));
    memset(vis1,0,sizeof(vis1));
    memset(d1,0,sizeof(d1));
    for(int i = 1; i<=n; i++)
    {
        for(int j = 1; j<=p; j++)
        {
            d1[cnt].l = sqrt((jud[i].x-fea[i].x)*(jud[i].x-fea[i].x)+(jud[i].y-fea[i].y)*(jud[i].y-fea[i].y));;
            d1[cnt].a = i;
            d1[cnt].b = j;
            cnt++;
        }
    }
    sort(d1,d1+cnt,cmp);
    for(int i = 0; i<cnt; i++)
    {
        if(vis[d1[i].a]==0 && vis1[d1[i].b]==0)
        {
            vis[d1[i].a]=1;
            vis1[d1[i].b]=1;
            ans += d1[i].l;
        }
    }
}
void solve()
{
    cin>>n>>m>>p;
    for(int i=1; i<=n; i++)
    {
        cin>>jud[i].x>>jud[i].y;
    }
    work(m);
    work(p);
    printf("%.6lf",ans);
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
//    cin>>t;
    while(t--)
    {
        solve();
    }
}
/*
for(int i=1; i<=n; i++)
2 2 0
0 0
0 -2
0 -1
0 1
*/