const int N = 400005;
const int LG = 21;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;

#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())

#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL

int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};

ll inq(ll x, ll y)
{
    if (!y) re 1 % MOD;
    ll l = inq(x, y / 2);
    if (y % 2) re l * l % MOD * x % MOD;
    re l * l % MOD;
}

ll rev(ll x)
{
    return inq(x, MOD - 2);
}

bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;

void __precompute_combinatorics()
{
    __precomputed_combinatorics = 1;
    __fact.resize(N);
    __ufact.resize(N);
    __rev.resize(N);
    __rev[1] = 1;
    for (int i = 2; i < N; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
    __fact[0] = 1, __ufact[0] = 1;
    for (int i = 1; i < N; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}

ll fact(int x)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[x];
}

ll cnk(int n, int k)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}

int n, q;
int b[N];
vector<int> r[N];
int dp[N];
int hehe;

int Tree[4 * N];

void Set(int pos, int val, int L = 0, int R = n + 1, int V = 0)
{
    if (L + 1 == R)
    {
        Tree[V] = val;
        return;
    }
    int M = (L + R) / 2;
    if (pos < M) Set(pos, val, L, M, 2 * V + 1);
    else Set(pos, val, M, R, 2 * V + 2);
    Tree[V] = min(Tree[2 * V + 1], Tree[2 * V + 2]);
}

int Get(int l, int r, int L = 0, int R = n + 1, int V = 0)
{
    if (r <= L || R <= l) return INF;
    if (l <= L && R <= r) return Tree[V];
    int M = (L + R) / 2;
    return min(Get(l, r, L, M, 2 * V + 1), Get(l, r, M, R, 2 * V + 2));
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    forn(i, n) cin >> b[i + 1];
    forn(i, n) hehe += (b[i + 1] == 0);
    forn(i, n) if (b[i + 1] == 0) b[i + 1] = -1;
    cin >> q;
    forn(i, q)
    {
        int l, x;
        cin >> l >> x; r[l].push_back(x);
    }
    for (int pos = 1; pos <= n; pos++)
    {
        sort(all(r[pos]));
        reverse(all(r[pos]));
    }
    fill(Tree, Tree + 4 * n + 4, INF);
    Set(0, 0);
    for (int pos = 1; pos <= n; pos++)
    {
        for (auto R : r[pos])
        {
            int L = pos - 1;
            //ll val = INF;
            //for (int i = L; i <= R; i++) val = min(val, dp[i]);
            //dp[R] = min(dp[R], val);
            Set(R, Get(L, R + 1));
        }
        Set(pos, min(Get(pos, pos + 1), Get(pos - 1, pos) + b[pos]));
        //dp[pos] = min(dp[pos], dp[pos - 1] + b[pos]);
        //for (int i = 1; i <= n; i++) cout << dp[i] << " ";
        //cout << "\n";
    }
    cout << Get(n, n + 1) + hehe;
}

/* Note:
Check constants at the beginning of the code.
    N is set to 4e5 but be careful in problems with large constant factor.
Check corner cases.
    N = 1
No def int long long for now.
Add something here.
*/


Measured memory_bytes: 20608