#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 1e5 + 5, INF = 1e9;

struct Node {
    int mn;
};

struct segTree {
    Node tree[N * 4];
    Node neutral = {INF};

    Node merge(Node u, Node v) {
        return {min(u.mn, v.mn)};
    }

    Node single(int x) {
        return {x};
    }

    void build(int x, int l, int r) {
        if (l == r) {
            tree[x] = single(INF);

            return;
        }

        int m = (l + r) >> 1;

        build(x * 2, l, m);
        build(x * 2 + 1, m + 1, r);

        tree[x] = merge(tree[x * 2], tree[x * 2 + 1]);
    }

    void set(int x, int l, int r, int i, int v) {
        if (l == r) {
            tree[x] = single(min(v, tree[x].mn));

            return;
        }

        int m = (l + r) >> 1;

        if (i <= m)
            set(x * 2, l, m, i, v);
        else
            set(x * 2 + 1, m + 1, r, i, v);

        tree[x] = merge(tree[x * 2], tree[x * 2 + 1]);
    }

    Node query(int x, int lX, int rX, int l, int r) {
        if (lX > r || rX < l)
            return neutral;

        if (lX >= l && rX <= r)
            return tree[x];

        int m = (lX + rX) >> 1;

        Node u = query(x * 2, lX, m, l, r);
        Node v = query(x * 2 + 1, m + 1, rX, l, r);

        return merge(u, v);
    }
} st;

void testCase() {
    st.build(1, 0, N - 1);

    int s;
    cin >> s;

    int a, b;
    vector<pair<pair<int, int>, int>> v(s);
    for (int i = 0; i < s; i++) {
        cin >> a >> b;

        v[i] = {{a, b}, i + 1};
    }

    sort(v.rbegin(), v.rend());

    int c;
    cin >> c;
    vector<pair<int, int>> p(c);
    for (int i = 0; i < c; i++) {
        cin >> a >> b;

        p[i] = {a, b};
    }

    sort(p.rbegin(), p.rend());

    int l = 0;
    ll sol = 0;
    for (auto i: p) {
        while (l < s && v[l].first.first >= i.first)
            st.set(1, 0, N - 1, v[l].first.second, v[l].second), l++;

        sol += st.query(1, 0, N - 1, 0, i.second).mn;
    }

    cout << sol;
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}