python3，CF893C Rumor题

n,m = map(int,input().split())
cost = [0]
cost += list(map(int,input().split()))
parent = [0 for i in range(100100)]
ans = 0
def root_search(node):
    # TODO: 这个函数发生runtime error
    '''
    如果不加try-except就会re，为什么呢？
    '''
    try:
        if parent[node]==0:
            return node
        else:
            parent[node] = root_search(parent[node])
            return parent[node]
    except:return node
for i in range(1,m+1):
    f1,f2 = map(int,input().split())
    tep_node1 = root_search(f1)
    tep_node2 = root_search(f2)
    if tep_node1 == tep_node2:
        continue
    if cost[tep_node1] <= cost[tep_node2]:
        parent[tep_node2] = tep_node1
    else:parent[tep_node1] = tep_node2
for i in range(1,n+1):
    if parent[i] == 0:
        ans += cost[i]
print(ans)