#include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
const int maxn=3e5+10;
int fac[maxn],inv[maxn];
typedef long long ll;
void add(int &x,int y){
    if((x+=y)>=mod)x-=mod;
}
void del(int &x,int y){
    if((x-=y)<0)x+=mod;
}
int ksm(int x,int k){
    int res=1;
    while(k){
        if(k&1)res=(ll)res*x%mod;
        x=(ll)x*x%mod;
        k/=2;
    }
    return res;
}
int ny(int x){
    return ksm(x,mod-2);
}
void init()
{
    fac[0]=1;
    for(int i=1;i<maxn;i++)fac[i]=(ll)fac[i-1]*i%mod;
    inv[maxn-1]=ny(fac[maxn-1]);
    for(int i=maxn-2;i>=0;i--)inv[i]=(ll)inv[i+1]*(i+1)%mod;
}
int C(int n,int m){
    if(n<m)return 0;
    if(n==m)return 1;
    return (ll)fac[n]*inv[n-m]%mod*inv[m]%mod;
}
int solve()
{
    int n,m,k;cin>>n>>m>>k;
    vector<vector<int>> ve(n+1);
    for(int i=1;i<n;i++){
        int x,y;cin>>x>>y;
        ve[x].push_back(y);
        ve[y].push_back(x);
    }
    vector<int>dep(n+1);
    vector<vector<int>> f(21,vector<int>(n+1));
    function<void(int,int)> dfs1 = [&](int x,int h){
        dep[x]=dep[h]+1;
        for(int i=0;i<=19;i++)
            f[i+1][x]=f[i][f[i][x]];
        for(auto it:ve[x])if(it!=h){
            f[0][it]=x;
            dfs1(it,x);
        }
    };
    dfs1(1,0);
    int ans=0;
    auto lca = [&](int x,int y){
        if(dep[x]<dep[y])swap(x,y);
        for(int i=20;i>=0;i--){
            if(dep[f[i][x]]>=dep[y])x=f[i][x];
            if(x==y)return x;
        }
        for(int i=20;i>=0;i--)
            if(f[i][x]!=f[i][y])
                x=f[i][x],y=f[i][y];
        return f[0][x];
    };
    vector<int> addp(n+1),adde(n+1);
    vector<int> valp(n+1),vale(n+1);
    while(m--){
        int x,y;cin>>x>>y;
        int l=lca(x,y);
        {
            valp[l]++;
            addp[l]-=2;
            addp[x]++;addp[y]++;
        }
        {
            adde[l]-=2;
            adde[x]++;adde[y]++;
        }
    }
    function<void(int,int)> dfs = [&](int x,int h){
        for(auto it:ve[x])if(it!=h){
            dfs(it,x);
            addp[x]+=addp[it];
            adde[x]+=adde[it];
        }
        valp[x]+=addp[x];
        vale[x]+=adde[x];
        add(ans,C(valp[x],k));
        if(x!=1)del(ans,C(vale[x],k));
    };
    dfs(1,0);
    return ans;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;cin>>T;
    init();
    while(T--)cout<<solve()<<"\n";
}

/*
1
3 6 2
1 2
1 3
1 1
2 2
3 3
1 2
1 3
2 3

*/