#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const int N=1e5+86;
const ll INF=0x3f3f3f3f3f3f3f3f;

int T,n;
ll a[N],b[N];
struct edge{int to,nxt;}e[N<<1];
int head[N],tot;
void add(int u,int v){e[++tot]={v,head[u]},head[u]=tot;}

struct node{int hson,dep,mdep;}p[N];
void dfs1(int u,int fa)
{
    p[u].hson=0;
    p[u].dep=p[fa].dep+1;
    p[u].mdep=p[u].dep;
    for(int i=head[u];i;i=e[i].nxt)
    {
        int v=e[i].to;
        if(v==fa) continue;
        dfs1(v,u);
        p[u].mdep=max(p[u].mdep,p[v].mdep);
        if(!p[u].hson||p[p[u].hson].mdep<p[v].mdep) p[u].hson=v;
    }
}

ll f[N][50],cnt=1;
void dfs2(int u,int fa,int top)
{//printf("%d\n",u);
    if(p[u].hson) dfs2(p[u].hson,u,top);
    for(int i=head[u];i;i=e[i].nxt)
    {
        int v=e[i].to;
        if(v==fa||v==p[u].hson) continue;
        cnt++;
        for(int j=0;j<=p[v].mdep-p[v].dep;j++)
            f[cnt][j]=0;
        // memset(f[cnt],0,(p[v].mdep-p[v].dep+1)<<3);
        dfs2(v,u,v);
        for(int j=0;j<=p[v].mdep-p[v].dep;j++)
            f[cnt-1][p[v].dep-p[top].dep+j]=min(a[p[v].dep-p[u].dep+j],f[cnt-1][p[v].dep-p[top].dep+j]+f[cnt][j]);//printf("%d %d %lld\n",u,p[v].dep-p[top].dep+j,f[cnt-1][p[v].dep-p[top].dep+j]);
        cnt--;
    }
    f[cnt][p[u].dep-p[top].dep]=b[p[u].dep-p[top].dep];
}

template<typename T>
inline void read(T &x)
{
    T k=1;char ch=getchar();x=0;
    while(ch<'0'||ch>'9'){if(ch=='-') k=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    x*=k;
}

signed main()
{
    read(T);
    while(T--)
    {
        read(n);
        memset(head+1,0,n<<2);
        tot=0;
        cnt=1;
        for(int i=0;i<=n-1;i++)
            read(a[i]),b[i]=min(a[i],i>0?b[i-1]:INF);
        for(int i=1,u,v;i<=n-1;i++)
            read(u),read(v),add(u,v),add(v,u);
        dfs1(1,0);
        dfs2(1,0,1);
        ll sum=0;
        for(int i=0;i<=p[1].mdep-1;i++)
            f[1][i]=min(f[1][i],a[i]),sum+=f[1][i];
        printf("%lld\n",sum);
    }
    return 0;
}