#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i=a;i<(b);++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;

ll M = 1e9+7;

ll comb(ll num, ll div){
    ll res = 1;
    for(int i = 0; i<div;i++){
        res*=(num-i);
        res%=M;
    }
    for(int i = 1; i<=div;i++){
        res/=i;
    }
    return res;
}

void dfs(vector<vector<int>> &graph, vector<bool>&vis, int v){
    if(vis[v])
        return;
    vis[v] = true;
    for(auto edge: graph[v]){
        dfs(graph, vis, edge);
    }
}

ll sub(int a, int b){
    return (a+M-b)%M;
}
ll add(int a, int b){
    return (a+b)%M;
}
ll mult(int a, int b){
    return (a*b+M)%M;
}
ll pow(int a, int b){
    int res = 1;
    rep(i,0,b)
        res = mult(res, a);
    return res;
}


int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    
    int n, m, t;cin>>n>>m>>t;
    vector<int> arr(t);
    rep(i,0, t){
        cin>>arr[i];
    }
    vector<pii> edges;


    rep(i,0, m){
        int u;int v;cin>>u>>v;
        edges.push_back({u, v});
    }

    vector<int> totals(22);

    rep(bits, 0, 1<<m){
        vector<vector<int>> graph(n);
        int ones = 0;
        rep(i,0,m){
            if(bits&(1<<i)){
                auto edge = edges[i];
                graph[edge.first].push_back(edge.second);
                graph[edge.second].push_back(edge.first);
                ones++;
            }

        }
        vector<bool> vis(n);
        int comp=0;
        for(int i = 0; i<n; i++){
            if(!vis[i])comp++;
            dfs(graph, vis, i);
        }
        int sum = 0;
        for(int color=1; color<=21; color++){
            totals[color]=add(add(mult((ones&1)?1:-1,pow(color, comp)), totals[color]), -sum);
            sum = add(totals[color], sum);
        }
    }
    vector<int> powers(1e6);
    powers[0] = 1;


    rep(q, 0, t){
        ll res = 1;
        rep(i, 0, 21){
            res = mult(res, arr[i]);
        }
        for(int i = 1; i<=21; i++){
            if(arr[i]>=i){
                res = sub(res, mult(totals[i], comb(arr[i], i)));
            }
        }
        cout<<res<<'\n';
    }
}