inputt = open("asmax.in")
outputt = open("asmax.out",'w')
N = int(inputt.readline())
V = [0]
line = inputt.readline().split()

for x in line:
    V.append(int(x))
L = []
for i in range(0,N+1):
    L.append([])
for x in inputt:
    x = x.split()
    f1 = int(x[0])
    f2 = int(x[1])
    #print(f1,f2)
    #if L[f1] == list([0]):
        #L[f1].clear()
    L[f1].append(f2)
    L[f2].append(f1)
L = [[0],[2,3,4],[1],[1],[1,5],[4]]
viz = [0]*(N+1)
SMAX = 0
def DFS(L,V,viz,currentNode):
    viz[currentNode] = 1
    global S
    S += V[currentNode]
    global SMAX
    if S > SMAX:
        SMAX = S
    for x in L[currentNode]:
        if viz[x] == 0:
            DFS(L,V,viz,x)
for i in range(1,N+1):
    S = 0
    DFS(L,V,viz,i)
outputt.write(str(SMAX))