#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <tuple>
#include <iomanip>

using namespace std;

#define rep(i, n) for(int i = 0; i < n; i++)
#define sz(x) (long long)(x).size()


bool comp(pair<long long, pair<int, int>> a, pair<long long, pair<int, int>> b) {
    if (a.first < b.first) return true;
    if (a.first > b.first) return false;
    if (a.second.first < b.second.first) return true;
    if (a.second.first > b.second.first) return false;
    if (a.second.second < b.second.second) return true;
    if (a.second.second > b.second.second) return false;
    return 0;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int m, n, p;
    cin >> m >> n >> p;

    vector<tuple<int, int, int>> judges;
    for (int i = 0 ; i < n; i++) {
        int x, y;
        cin >> x >> y;
        judges.emplace_back(x, y, i);
    }

    vector<tuple<int, int, int>> tar;
    for (int i = 0 ; i < m; i++) {
        int x, y;
        cin >> x >> y;
        tar.emplace_back(x, y, i);
    }

    vector<tuple<int, int, int>> feather;
    for (int i = 0 ; i < p; i++) {
        int x, y;
        cin >> x >> y;
        feather.emplace_back(x, y, i);
    }

    vector<bool> judgeAssigned(n, false), tarAssigned(m, false), featherAssigned(p, false);
    vector<pair<long long, pair<int, int>>> d;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            d.push_back({(get<0>(judges[i])-get<0>(tar[j]))*(get<0>(judges[i])-get<0>(tar[j])) + 
                           (get<1>(judges[i])-get<1>(tar[j]))*(get<1>(judges[i])-get<1>(tar[j])), 
                            {i, j}});
        }
    }
    sort(d.begin(), d.end(), comp);
    long double out = 0;
    rep(i, sz(d)) {
        if (judgeAssigned[d[i].second.first] or tarAssigned[d[i].second.second]) {
            continue;
        }
        out+=sqrt(d[i].first);
        judgeAssigned[d[i].second.first] = true;
        tarAssigned[d[i].second.second] = true;
    }
    d.clear();
    judgeAssigned = vector<bool>(n, false);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < p; j++) {
            d.push_back({(get<0>(judges[i])-get<0>(feather[j]))*(get<0>(judges[i])-get<0>(feather[j])) + 
                           (get<1>(judges[i])-get<1>(feather[j]))*(get<1>(judges[i])-get<1>(feather[j])), 
                            {i, j}});
        }
    }
    sort(d.begin(), d.end(), comp);
    rep(i, sz(d)) {
        if (judgeAssigned[d[i].second.first] or featherAssigned[d[i].second.second]) {
            continue;
        }
        out+=sqrt(d[i].first);
        judgeAssigned[d[i].second.first] = true;
        featherAssigned[d[i].second.second] = true;
    }

    cout << setprecision(8) << fixed << out << endl;

    return 0;
}