#include using namespace std; using ll = long long; using ld = long double; // -------------------------------------------------------- #define FOR(i,l,r) for (ll i = (l); i < (r); ++i) #define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) RFOR(i,0,n) #define ALL(c) (c).begin(), (c).end() #define RALL(c) (c).rbegin(), (c).rend() #define SORT(c) sort(ALL(c)) #define RSORT(c) sort(RALL(c)) #define MIN(c) *min_element(ALL(c)) #define MAX(c) *max_element(ALL(c)) #define COUNT(c,v) count(ALL(c),(v)) #define SZ(c) ((ll)(c).size()) #define BIT(b,i) (((b)>>(i)) & 1) #define PCNT(b) __builtin_popcountll(b) #define P0(i) (((i) & 1) == 0) #define P1(i) (((i) & 1) == 1) #define LB(c,v) distance((c).begin(), lower_bound(ALL(c), (v))) #define UB(c,v) distance((c).begin(), upper_bound(ALL(c), (v))) #define UQ(c) SORT(c), (c).erase(unique(ALL(c)), (c).end()) #define elif else if #ifdef _LOCAL #define debug_bar cerr << "--------------------\n"; #define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n' #define debug_pair(x) cerr << "l." << __LINE__ << " : " << #x << " = (" << x.first << "," << x.second << ")\n"; template void debug_line(const vector& ans, int l, int r, int L = 0) { cerr << "l." << L << " :"; for (int i = l; i < r; i++) { cerr << ' ' << ans[i]; } cerr << '\n'; } #else #define cerr if (false) cerr #define debug_bar #define debug(x) #define debug_pair(x) template void debug_line([[maybe_unused]] const vector& ans, [[maybe_unused]] int l, [[maybe_unused]] int r, [[maybe_unused]] int L = 0) {} #endif template void input(T&... a) { (cin >> ... >> a); } void print() { cout << '\n'; } template void print(const T& a) { cout << a << '\n'; } template void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template void cout_line(const vector& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; } cout << '\n'; } template bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; } template bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; } template T SUM(const vector& A) { return accumulate(ALL(A), T(0)); } template vector cumsum(const vector& A, bool offset = true) { int N = A.size(); vector S(N+1, 0); for (int i = 0; i < N; i++) { S[i+1] = S[i] + A[i]; } if (not offset) { S.erase(S.begin()); } return S; } ll mod(ll x, ll m) { assert(m != 0); return (x % m + m) % m; } ll ceil(ll a, ll b) { if (b < 0) { return ceil(-a, -b); } assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); } ll floor(ll a, ll b) { if (b < 0) { return floor(-a, -b); } assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); } ll powint(ll x, ll n) { assert(n >= 0); if (n == 0) { return 1; }; ll res = powint(x, n>>1); res *= res; if (n & 1) { res *= x; } return res; } pair divmod(ll a, ll b) { assert(b != 0); ll q = floor(a, b); return make_pair(q, a - q * b); } ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); } ll digit_len(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; } ll digit_sum(ll n) { assert(n >= 0); ll sum = 0; while (n > 0) { sum += n % 10; n /= 10; } return sum; } ll digit_prod(ll n) { assert(n >= 0); if (n == 0) { return 0; } ll prod = 1; while (n > 0) { prod *= n % 10; n /= 10; } return prod; } ll xor_sum(ll x) { assert(0 <= x); switch (x % 4) { case 0: return x; case 1: return 1; case 2: return x ^ 1; case 3: return 0; } assert(false); } string toupper(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = toupper(T[i]); } return T; } string tolower(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = tolower(T[i]); } return T; } int a2i(const char& c) { assert(islower(c)); return (c - 'a'); } int A2i(const char& c) { assert(isupper(c)); return (c - 'A'); } int d2i(const char& d) { assert(isdigit(d)); return (d - '0'); } char i2a(const int& i) { assert(0 <= i && i < 26); return ('a' + i); } char i2A(const int& i) { assert(0 <= i && i < 26); return ('A' + i); } char i2d(const int& i) { assert(0 <= i && i <= 9); return ('0' + i); } using P = pair; using VP = vector

; using VVP = vector; using VS = vector; using VVS = vector; using VI = vector; using VVI = vector; using VVVI = vector; using VLL = vector; using VVLL = vector; using VVVLL = vector; using VB = vector; using VVB = vector; using VVVB = vector; using VD = vector; using VVD = vector; using VVVD = vector; using VLD = vector; using VVLD = vector; using VVVLD = vector; const ld EPS = 1e-10; const ld PI = acosl(-1.0); constexpr ll MOD = 1000000007; // constexpr ll MOD = 998244353; constexpr int inf = (1 << 30) - 1; // 1073741824 - 1 constexpr ll INF = (1LL << 62) - 1; // 4611686018427387904 - 1 // -------------------------------------------------------- #include using namespace atcoder; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); ll N; input(N); VLL B(N),C(N); REP(i,N) input(B[i], C[i]); ll M; input(M); VLL D(M),E(M); REP(i,M) input(D[i], E[i]); ll K = 1000; ll BIG = 1e9; ll s = 2*N, t = s + 1; mf_graph G(2*N + 2); REP(i,N) { G.add_edge(s, i, K - C[i]); G.add_edge(i, N+i, K); G.add_edge(N+i, t, K - B[i]); } REP(i,M) { G.add_edge(N+D[i], E[i], BIG); } ll F = G.flow(s, t); ll ans = N*K - F; print(ans); return 0; }