#include<iostream>
#include<fstream>
#include<vector>
#include<map>
#include<ctime>
#define pb push_back
#define ll long long
using namespace std;
const int N=102123;
const ll inf=1e17+7;
vector<ll> g[N],c[N];
int n,x,y,z,t;
ll ans,cur;
vector<int> v;
int a[N];
int l,r;
int icnt=0;
void dfs(int ve,int p){
    ++icnt;
    v.pb(a[ve]);
    if(v.size()>2){
        int cnt=0;
        for(int i=1;i+1<v.size();++i)
            if(v[i-1]<v[i]&&v[i]>v[i+1])
                ++cnt;
           // cout<<cnt<<
      //  if(l<=cnt&&cnt<=r){for(int i=0;i<v.size();++i)cout<<v[i]<<' ';cout<<cnt<<"\n";}
        if(l<=cnt&&cnt<=r)++ans;
    }
    for(int i=0;i<g[ve].size();++i){
        if(g[ve][i]==p)continue;
        dfs(g[ve][i],ve);
    }
    v.pop_back();
}
main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    //freopen("0.in","r",stdin);
   // freopen("1.txt","w",stdout);
   //freopen("1.txt","r",stdin);
   //freopen("1.out","w",stdout);
    cin>>t;
    for(;t;--t){
    cin>>n>>l>>r;
    for(int i=1;i<=n;++i)
        g[i].clear(),c[i].clear();
    for(int i=1;i<=n;++i)
        cin>>a[i];
    for(int i=1;i<n;++i){
        cin>>x>>y;
        g[x].pb(y);
        g[y].pb(x);
    }
    ans=0;
    for(int i=1;i<=n;++i){
        dfs(i,0);
    }
    cout<<ans/2<<"\n";
    }
   // cout<<icnt<<endl;
   // cout<<clock()<<endl;

}