#include //#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //using namespace atcoder; using namespace std; using ll = long long; #define all(A) A.begin(),A.end() using vll = vector; #define rep(i, n) for (long long i = 0; i < (long long)(n); i++) using Graph = vector>>>; ll gcd(ll(a), ll(b)) { ll c = a; while (a % b != 0) { c = a % b; a = b; b = c; } return b; } ll N, M, Q; ll an = 0; vll A, B, C, D; void next_combination(vll S){ if (S.size() == N) { ll k = 0; rep(q, Q) { if (S[B[q]] - S[A[q]] == C[q])k += D[q]; } an = max(an, k); //cout << k << endl; } else { vll NE = S; if (S.size() == 0) { for (ll j = 1; j <= M; j++) { NE.push_back(j); next_combination(NE); NE.pop_back(); } } else { for (ll j = S[S.size() - 1]; j <= M; j++) { NE.push_back(j); next_combination(NE); NE.pop_back(); } } } return; } int main(){ ll N; cin >> N; ll P = 0; ll an = 0; vll A(N - 1); rep(i, N - 1) { cin >> A[i]; } rep(i, N-1) { ll B, C; cin >> B >> C; P -= B; P += C; an += A[i] * P; } cin >> N >> N; cout << an << endl; }