import sys
input = sys.stdin.readline

N=int(input())
P=list(map(int,input().split()))
M=int(input())
X=[]
for i in range(M):
    x,y=map(int,input().split())
    x-=1
    y-=1
    X.append((x,y))

K=int(input())

Y=[]
for i in range(K):
    a,b,s=map(int,input().split())
    a-=1
    b-=1
    Y.append((a,b,s))

# dinic法

from collections import defaultdict,deque

V=2+N+K
EDGE=[defaultdict(int) for i in range(V)]

start=V-2
goal=V-1

MAX=0
for i in range(N):
    if P[i]>0:
        u,v,c=start,i,P[i]
        EDGE[u][v]=c
        MAX+=P[i]
    else:
        u,v,c=i,goal,-P[i]
        EDGE[u][v]=c

for x,y in X:
    u,v,c=y,x,float("inf")
    EDGE[u][v]=c

point=N
for a,b,s in Y:
    MAX+=s
    u,v,c=start,point,s
    EDGE[u][v]=c

    u,v,c=point,a,float("inf")
    EDGE[u][v]=c

    u,v,c=point,b,float("inf")
    EDGE[u][v]=c

    point+=1

ANS=0
while True:
    # まずBFSする

    DIS=[-1]*V
    Q=deque([start])
    DIS[start]=0
    EDGE2=[[] for i in range(V)]

    while Q:
        x=Q.popleft()
        for to in EDGE[x]:
            if EDGE[x][to]==0:
                continue
            
            if DIS[to]==-1:
                DIS[to]=DIS[x]+1
                Q.append(to)
                EDGE2[x].append(to)
                
            elif DIS[to]==DIS[x]+1:
                EDGE2[x].append(to)

    if DIS[goal]==-1:
        break

    # BFSしたときのEDGEを使ってDFSする

    MINCOST=[float("inf")]*V
    NOW=start
    ROUTE=[-1]*V
    
    while NOW!=-1: # DFS

        cost=MINCOST[NOW]
        
        if NOW==goal:
            ANS+=cost
            i=goal
            
            while i!=start: # goalからたどり,Routeを使ってEDGEの更新
                j=ROUTE[i]
                if EDGE[j][i]==cost:
                    NOW=j
                    EDGE2[j].pop()
                
                EDGE[j][i]-=cost # 使ったルートをいけなく更新
                MINCOST[j]-=cost                
                EDGE[i][j]+=cost # 逆向きに進めるようにする.
                i=j
            continue

        if EDGE2[NOW]:
            to=EDGE2[NOW][-1]
            ROUTE[to]=NOW
            MINCOST[to]=min(cost,EDGE[NOW][to])
            NOW=to

        else:
            if NOW==start:
                break
            EDGE2[ROUTE[NOW]].pop()
            NOW=ROUTE[NOW]
            

print(MAX-ANS)