#include <iostream>
#include <algorithm>

using namespace std;

const int MAXN = 1000005;
const int LOG = 20;

int st[LOG][MAXN];

int main() {
    int n;
    if (!(cin >> n)) return 0;

    for (int i = 0; i < n; ++i)
        cin >> st[0][i];

    for (int j = 1; (1 << j) <= n; ++j)
        for (int i = 0; i + (1 << j) <= n; ++i)
            st[j][i] = min(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);

    int m;
    cin >> m;

    long long total_sum = 0;

    while(m--) {
        int L, R;
        cin >> L >> R;

        int len = R - L + 1;
        int log_len = 31 - __builtin_clz(len);
        int current_min = min(st[log_len][L], st[log_len][R - (1 << log_len) + 1]);

        total_sum += current_min;
    }

    cout << total_sum << "\n";

    return 0;
}