#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;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmNvbnN0IGludCBNQVhOID0gMTAwMDAwNTsKY29uc3QgaW50IExPRyA9IDIwOwoKaW50IHN0W0xPR11bTUFYTl07CgppbnQgbWFpbigpIHsKICAgIGludCBuOwogICAgaWYgKCEoY2luID4+IG4pKSByZXR1cm4gMDsKCiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47ICsraSkKICAgICAgICBjaW4gPj4gc3RbMF1baV07CgogICAgZm9yIChpbnQgaiA9IDE7ICgxIDw8IGopIDw9IG47ICsraikKICAgICAgICBmb3IgKGludCBpID0gMDsgaSArICgxIDw8IGopIDw9IG47ICsraSkKICAgICAgICAgICAgc3Rbal1baV0gPSBtaW4oc3RbaiAtIDFdW2ldLCBzdFtqIC0gMV1baSArICgxIDw8IChqIC0gMSkpXSk7CgogICAgaW50IG07CiAgICBjaW4gPj4gbTsKCiAgICBsb25nIGxvbmcgdG90YWxfc3VtID0gMDsKCiAgICB3aGlsZShtLS0pIHsKICAgICAgICBpbnQgTCwgUjsKICAgICAgICBjaW4gPj4gTCA+PiBSOwoKICAgICAgICBpbnQgbGVuID0gUiAtIEwgKyAxOwogICAgICAgIGludCBsb2dfbGVuID0gMzEgLSBfX2J1aWx0aW5fY2x6KGxlbik7CiAgICAgICAgaW50IGN1cnJlbnRfbWluID0gbWluKHN0W2xvZ19sZW5dW0xdLCBzdFtsb2dfbGVuXVtSIC0gKDEgPDwgbG9nX2xlbikgKyAxXSk7CgogICAgICAgIHRvdGFsX3N1bSArPSBjdXJyZW50X21pbjsKICAgIH0KCiAgICBjb3V0IDw8IHRvdGFsX3N1bSA8PCAiXG4iOwoKICAgIHJldHVybiAwOwp9Cg==