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

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,M; cin >> N >> M;
    vector<int> P(N);
    for(auto &p : P) cin >> p;  

    vector<set<int>> Graph(N);
    for(int i=0; i<N-1; i++){
        int u,v; cin >> u >> v;
        u--; v--;
        Graph.at(u).insert(v);
        Graph.at(v).insert(u);
    }

    vector<bool> NG(N);
    vector<int> check(M);
    for(auto &c : check) cin >> c,c--,NG.at(c) = true;
    
    priority_queue<pair<long long,int>> Q;
    for(int i=0; i<N; i++) if(Graph.at(i).size() == 1) Q.push({P.at(i),i});
    long long answer = 0;
    while(true){
        bool ok = false;
        while(Q.size()){
            auto [p,pos] = Q.top(); Q.pop();
            if(NG.at(pos)) continue;
            answer += p;
            int to = *Graph.at(pos).begin();
            Graph.at(to).erase(pos);
            if(Graph.at(to).size() == 1) Q.push({P.at(to),to});
            ok = true; break;
        }
        if(!ok) break;
        vector<int> next;
        for(auto pos : check) for(auto to : Graph.at(pos)) if(!NG.at(to)) NG.at(to) = true,next.push_back(to);
        swap(check,next);
    }

    cout << answer << endl;
}