//双指针：i遍历向量u，j遍历向量v，若idx相同则相乘

#include <iostream>
#include <vector>

#define x first
#define y second

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;

vector<PII> u,v;

int main(){

    int n,a,b;
    cin >> n >> a >> b;
    while(a--){
        int idx , val;
        cin >> idx >> val;
        u.push_back({idx,val});
    }
    while(b--){
        int idx , val;
        cin >> idx >> val;
        v.push_back({idx,val});
    }

    LL res = 0;
    int i=0 , j=0;
    while(i<u.size() && j<v.size()){
        if(u[i].x == v[j].x){
            res+=(LL)u[i].y * v[j].y;
            i++,j++;
        }else if(u[i].x < v[j].x){
            i++;
        }else{
            j++;
        }
    }

    cout << res << endl;

    return 0;
}