#include<iostream>
using namespace std;
const long long num = 10e5 + 5;
long long ni[num];
long long sum[num];
int main() {
int n;
cin >> n;
for (int i = 0;i < n;i++) {
cin >> ni[i];
}
sum[0] = ni[0];
for (int i = 1;i < n;i++) {
sum[i] = sum[i - 1] + ni[i];
}
int m;
cin >> m;
long long best = sum[n - 1];
while (m--) {
long long sub = sum[n - 1];
int tunnel[2];
for (int i = 0;i < 2;i++) {
cin >> tunnel[i];
sub -= ni[tunnel[i] - 1];
}
if (sub < best) { best = sub; }
}
cout << best << endl;
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpjb25zdCBsb25nIGxvbmcgbnVtID0gMTBlNSArIDU7CmxvbmcgbG9uZyBuaVtudW1dOwpsb25nIGxvbmcgc3VtW251bV07CgoKaW50IG1haW4oKSB7CgoJaW50IG47CgljaW4gPj4gbjsKCglmb3IgKGludCBpID0gMDtpIDwgbjtpKyspIHsKCQljaW4gPj4gbmlbaV07Cgl9CgoJc3VtWzBdID0gbmlbMF07Cglmb3IgKGludCBpID0gMTtpIDwgbjtpKyspIHsKCQlzdW1baV0gPSBzdW1baSAtIDFdICsgbmlbaV07Cgl9CgoJaW50IG07CgljaW4gPj4gbTsKCWxvbmcgbG9uZyBiZXN0ID0gc3VtW24gLSAxXTsKCgl3aGlsZSAobS0tKSB7CgkJbG9uZyBsb25nIHN1YiA9IHN1bVtuIC0gMV07CgkJaW50IHR1bm5lbFsyXTsKCQlmb3IgKGludCBpID0gMDtpIDwgMjtpKyspIHsKCQkJY2luID4+IHR1bm5lbFtpXTsKCQkJc3ViIC09IG5pW3R1bm5lbFtpXSAtIDFdOwoJCX0KCQlpZiAoc3ViIDwgYmVzdCkgeyBiZXN0ID0gc3ViOyB9Cgl9CgoJY291dCA8PCBiZXN0IDw8IGVuZGw7CgoJcmV0dXJuIDA7Cn0=