#include<bits/stdc++.h>
#define nl "\n"
#define fi first
#define se second
#define pi 3.14159
#define ll long long
#define odd(a)  (a&1)
#define even(a)  !(a&1)
#define Mod 1'000'000'007
#define INF 2'000'000'000 // 2e9
#define sz(x) int(x.size())
#define charToInt(s) (s - '0')
#define ull unsigned long long
#define number_line iota(all(vec) , 1)
#define all(s) s.begin(), s.end()
#define rall(v) v.rbegin() , v.rend()
#define fixed(n) fixed << setprecision(n)
#define Num_of_Digits(n) ((int)log10(n) + 1)
#define to_decimal(bin) stoll(bin, nullptr, 2)
#define Ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define Floor(n, m) (((n) / (m)) - ((n) % (m) ? 0 : 1))
#define Upper(s) transform(all(s), s.begin(), ::toupper);
#define Lower(s) transform(all(s), s.begin(), ::tolower);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
//  ----- bits-------
#define pcnt(n) __builtin_popcount(n)
#define pcntll(n) __builtin_popcountll(n)
#define clz(n) __builtin_clz(n)    // <---100
#define clzll(n) __builtin_clzll(n)
#define ctz(n) __builtin_ctz(n)  // 0001---->
#define ctzll(n) __builtin_ctzll(n)

using namespace std;

template < typename T = int > istream& operator >> (istream &in, vector < T > & v){
    for(auto & x : v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > & v){
    for(const T & x : v) out << x << " ";
    return out;
}

void esraa()
{
    //freopen("shuffle.in", "r", stdin), freopen("shuffle.out", "w", stdout);
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
vector < vector < ll > > adj;
vector < ll > powers;
int n , m , k;
vector < ll > vis;
// void dfs(int node , int cnt){
//     vis[node] = true;
//     if(cnt > m) return;
//     for(auto & child : adj[node]){
//         if(!vis[child]){
//             dfs(child , cnt + 1);
//         }
//     }
// }
ll rec(ll node , ll cnt , ll crd){
    if(crd >= k) return (crd == k ? 0 : -INF);
    if(cnt >= m) return (cnt == m ? 0 : -INF);
    //if(vis[node]) return 0;
    // rec case
    //if(sz(adj[node]) == 0) return powers[node];
    ll ret = -INF;
    for(auto & child : adj[node]){
        if(!vis[child]){
            vis[child] = 1;
            ret = rec(child , cnt + 1 , crd + 1) + powers[node - 1];
            max(ret , rec(child , cnt + 1 , crd));
        }
    }
    return ret;
}
void solve(){
    cin >> n >> m >> k;
    adj.assign(n + 5 , vector < ll > ());
    powers.assign(n , 0);
    cin >> powers;
    for(int i = 0 ; i < n - 1 ; i++){
        int u , v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    ll maxi = -INF , ans;
    for(int i = 1 ; i <= n ; i++){
        vis.assign(n + 1 , 0);
        ans = rec(i , 0 , 0);
        maxi = max(ans , maxi);
    }
    cout << maxi << nl;


}
int main()
{
    esraa();
    int t = 1;
    cin >> t;
    //cin.ignore();
    while(t--)
      solve();
    return 0;
}