#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include <cstring>

using namespace std;
const int N = 1e6+5;
int t=1, n, m, p;
int a[N];
double ans=0.0;
struct note {
    double x, y;
}jud[N], fea[N],tar[N];
double dis(note a,note b){
    return sqrt((a.x-b.x)  *  ( a.x-b.x) + ( a.y-b.y) *(a.y-b.y));
}
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;
}
edge dis1[N];
double dis2[N];
bool vis[N],vis1[N];
void solve()
{
    cin>>n>>m>>p;
    for(int i=1; i<=n; i++)
    {
        cin>>jud[i].x>>jud[i].y;
    }
    for(int i = 1;i<=m;i++){
        cin>>tar[i].x>>tar[i].y;
    }
    for(int i = 1;i<=p;i++){
        cin>>fea[i].x>>fea[i].y;
    }

    int cnt = 0;
    for(int i = 1;i<=n;i++){
        for(int j =1;j<=m;j++){
            d1[cnt].l = dis(jud[i],tar[j]);
            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){
            ans += d1[i].l;
            vis[d1[i].a]=1;
            vis1[d1[i].b]=1;
        }
    }

    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 = dis(jud[i],fea[j]);
            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;
        }
    }


    printf("%.6lf",ans);
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
//    cin>>t;
    while(t--) {
        solve();
    }
}