using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var p = NList;
        var map = NMap(n - 1);
        c = NList;

        var tree = new HashSet<int>[n];
        for (var i = 0; i < n; ++i) tree[i] = new HashSet<int>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add(edge[1]);
            tree[edge[1]].Add(edge[0]);
        }
        var times = Enumerable.Repeat(int.MaxValue / 2, n).ToArray();
        var q = new Queue<int>();
        foreach (var ci in c)
        {
            times[ci - 1] = 0;
            q.Enqueue(ci - 1);
        }
        while (q.Count > 0)
        {
            var cur = q.Dequeue();
            foreach (var next in tree[cur])
            {
                if (times[next] <= times[cur] + 1) continue;
                times[next] = times[cur] + 1;
                q.Enqueue(next);
            }
        }
        var ans = 0L;
        var pq = new PriorityQueue<int, int>();
        for (var i = 0; i < n; ++i) if (tree[i].Count == 1) pq.Enqueue(i, -p[i]);
        for (var i = 0; i < n; ++i)
        {
            while (pq.Count > 0)
            {
                var e = pq.Dequeue();
                if (i < times[e])
                {
                    foreach (var next in tree[e])
                    {
                        tree[next].Remove(e);
                        if (tree[next].Count == 1) pq.Enqueue(next, -p[next]);
                    }
                    tree[e] = new HashSet<int>();
                    ans += p[e];
                    break;
                }
            }
        }
        WriteLine(ans);
    }
}