1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<cstdlib>
 5 #include<algorithm>
 6 #include<cmath>
 7 #include<queue>
 8 #include<set>
 9 #include<map>
10 #include<vector>
11 #include<cctype>
12 #define inf 1e9
13 using namespace std;
14 const int maxn=500005;
15 const int maxd=25;
16
17 int N,D,M,W[maxn];
18 struct edge{ int to,next; }E[maxn<<1];
19 int first[maxn],np,f[maxn][maxd],g[maxn][maxd];
20 bool ob[maxn];
21
22 void _scanf(int &x)
23 {
24     x=0;
25     char ch=getchar();
26     while(ch<'0'||ch>'9') ch=getchar();
27     while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
28 }
29 void add_edge(int u,int v)
30 {
31     E[++np]=(edge){v,first[u]};
32     first[u]=np;
33 }
34 void data_in()
35 {
36     _scanf(N);_scanf(D);
37     for(int i=1;i<=N;i++) _scanf(W[i]);
38     _scanf(M);
39     int x,y;
40     for(int i=1;i<=M;i++){
41         _scanf(x); ob[x]=1;
42     }
43     for(int i=1;i<N;i++){
44         _scanf(x);_scanf(y);
45         add_edge(x,y); add_edge(y,x);
46     }
47 }
48 void DFS(int i,int fa)
49 {
50     for(int d=1;d<=D;d++) f[i][d]=W[i];
51     f[i][D+1]=inf;
52     if(ob[i]) f[i][0]=g[i][0]=W[i];
53     for(int p=first[i];p;p=E[p].next){
54         int j=E[p].to;
55         if(j==fa) continue;
56         DFS(j,i);
57         for(int d=0;d<=D;d++)
58             f[i][d]=min(f[i][d]+g[j][d],f[j][d+1]+g[i][d+1]);
59         for(int d=D;d>=0;d--) f[i][d]=min(f[i][d],f[i][d+1]);
60         g[i][0]=f[i][0];
61         for(int d=1;d<=D;d++) g[i][d]+=g[j][d-1];
62         for(int d=1;d<=D;d++) g[i][d]=min(g[i][d],g[i][d-1]);
63     }
64 }
65 void work()
66 {
67     DFS(1,0);
68     printf("%d\n",f[1][0]);
69 }
70 int main()
71 {
72     data_in();
73     work();
74     return 0;
75 }