B. Hierarchy

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;

#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
const int maxn = 1e3 + 20;
int e[maxn][maxn];
int cost[maxn];
struct node {
    int u, v, w;
    int tonext;
}E[10000 + 20];
int first[maxn];
int has[maxn];
int num;
void add(int u, int v, int w) {
    ++num;
    E[num].u = u;
    E[num].v = v;
    E[num].w = w;
    E[num].tonext = first[u];
    first[u] = num;
}
int a[maxn];
void work() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    int m;
    cin >> m;
    memset(e, 0x3f, sizeof e);
    for (int i = 1; i <= m; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        if (a[u] > a[v]) {
            has[v] = 1;
            has[u] = 1;
            e[u][v] = min(e[u][v], w);
        }
    }
    memset(cost, 0x3f, sizeof cost);
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (e[i][j] != inf) {
                add(i, j, e[i][j]);
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = first[i]; j; j = E[j].tonext) {
            int v = E[j].v;
            cost[v] = min(cost[v], E[j].w);
        }
    }
    int ans = 0;
    int t = 0;
    for (int i = 1; i <= n; ++i) {
        if (cost[i] == inf) { //不能到达
            t++; //有一个没有老板了，
            if (t == 2) { //2个没有就不行了
                cout << -1 << endl;
                return;
            }
            continue;
        }
        ans += cost[i];
    }
    cout << ans << endl;
}

int main() {
#ifdef local
    freopen("data.txt","r",stdin);
#endif
    IOS;
    work();
    return 0;
}