#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rng(i,l,r) for(int i=(l); i<(r); i++)
#define all(x) x.begin(),x.end()
using ll=long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    const ll MOD=1000000007;
    int c;
    cin>>c;
    if(c<=9) {
        int n,m,k;
        cin>>n>>m>>k;
        vector<vector<ll>> tree(n,vector<ll>(n,n));
        rep(i,n) {
            tree[i][i]=0;
        }
        rep(i,n-1) {
            int u,v;
            cin>>u>>v;
            u--;v--;
            tree[u][v]=1;
            tree[v][u]=1;
        }
        rep(k,n) {
            rep(i,n) {
                rep(j,n) {
                    tree[i][j]=min(tree[i][j],tree[i][k]+tree[k][j]);
                }
            }
        }
        vector<pair<int,int>> nt;
        rep(i,m) {
            int a,b;
            cin>>a>>b;
            a--;b--;
            nt.emplace_back(a,b);
        }
        vector<int> s(k);
        rep(i,k) {
            cin>>s[i];
            s[i]--;
        }
        vector<vector<int>> ok(k,vector<int>(m,0));
        rep(i,k) {
            rep(j,m) {
                int a,b;
                tie(a,b)=nt[j];
                if(abs(tree[s[i]][a]-tree[s[i]][b])==tree[a][b]) {
                    ok[i][j]=1;
                }
            }
        }
        vector<ll> pow={1};
        rep(i,m)pow.emplace_back((pow.back()*2)%MOD);
        ll ans=0;
        rng(i,1,1<<k) {
            vector<int> nok(m,1);
            ll sign=-1;
            rep(j,k) {
                if((i>>j)&1) {
                    sign*=-1;
                    rep(p,m) {
                        if(ok[j][p]==0)nok[p]=0;
                    }
                }
            }
            int sum=0;
            rep(j,m)sum+=nok[j];
            ans+=sign*pow[sum];
            ans%=MOD;
        }
        ans+=MOD;
        ans%=MOD;
        cout<<ans<<"\n";
    }
}