#include <bits/stdc++.h>
using namespace std;

template<class T>
bool chmax(T& a, const T& b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>
bool chmin(T& a, const T& b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) is >> e;
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge() {}
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

using LL = int64_t;

#define fs first
#define sc second

const int64_t MOD = 1e9+7;


struct UnionFind
{
    vector<int> par, sz;
    const int n;
    UnionFind(int n) : n(n), par(n), sz(n, 1) {
        for (int i = 0; i < n; ++i) par[i] = i;
    }

    int root(int x) {
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }

    void merge(int x, int y) {
        x = root(x);
        y = root(y);
        if (x == y) return;
        if (sz[x] < sz[y]) swap(x, y);
        par[y] = x;
        sz[x] += sz[y];
        sz[y] = 0;
    }

    bool issame(int x, int y) {
        return root(x) == root(y);
    }

    int size(int x) {
        return sz[root(x)];
    }

    friend ostream& operator<<(ostream& os, UnionFind& uf) {
        os << "[";
        for (int i = 0; i < uf.n; ++i) {
            if (i > 0) os << " ";
            os << uf.root(i);
        }
        return os << "]" << endl;
    }
};


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    int n; cin >> n;
    vector<int> c(n); cin >> c;
    vector<vector<int>> g(n);
    vector<vector<pair<int,int>>> G(n);
    UnionFind uf(n);

    int m; cin >> m;
    for (int i = 0; i < m; ++i) {
        int s, t; cin >> s >> t; --s, --t;
        G[s].emplace_back(c[t], t);
        G[t].emplace_back(c[s], s);
        if (c[s] == c[t]) {
            uf.merge(s, t);
        }
        if (c[s] < c[t]) {
            g[s].push_back(t);
        }
        if (c[t] < c[s]) {
            g[t].push_back(s);
        }
    }
    for (int i = 0; i < n; ++i) {
        sort(G[i].begin(), G[i].end());
        for (int j = 0; j < (int)G[i].size()-1; ++j) {
            int u = G[i][j].second, v = G[i][j+1].second;
            if (c[u] == c[v]) {
                uf.merge(u, v);
            }
            if (c[u] < c[v]) {
                g[u].push_back(v);
            }
            if (c[v] < c[u]) {
                g[v].push_back(u);
            }
        }
    }

    vector<vector<int>> gg(n);

    for (int i = 0; i < n; ++i) {
        for (int u : g[i]) {
            gg[uf.root(i)].push_back(uf.root(u));
        }
    }
    for (int i = 0; i < n; ++i) {
        sort(gg[i].begin(), gg[i].end());
        gg[i].erase(unique(gg[i].begin(), gg[i].end()), gg[i].end());
    }

    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 0);
    sort(ord.begin(), ord.end(), [&](int i,int j){
            return c[i] < c[j];
            });
    vector<int> dp(n, 1);

    for (int i : ord) {
        if (i != uf.root(i)) continue;
        for (int u : gg[i]) {
            chmax(dp[u], dp[i] + 1);
        }
    }

    LL ans = 0;
    for (int i = 0; i < n; ++i) {
        if (i != uf.root(i)) continue;
        ans += dp[i] * uf.size(i);
    }
    cout << ans << endl;



    return 0;
}



Measured memory_bytes: 25160