// #pragma comment(linker, "/STACK:102400000,102400000")
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
// #pragma GCC optimize("trapv")
#include<bits/stdc++.h>

#define int long long
using namespace std;
 
#define rep(i,n) for (int i=0;i<(int)(n);++i)
#define rep1(i,n) for (int i=1;i<=(int)(n);++i)
#define range(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define F first
#define S second
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
 
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
const int mod=998244353;
const int INF=LLONG_MAX/4;
const int maxn=2000007;
const double EPS=1e-9;
const int N=5007;

int n,m;
int d[maxn],sum[maxn],cnt[maxn],ans[maxn];
map<pii,int> edges;
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0), cout.precision(15);
    cin>>n>>m;
    rep(i,m){
        int u,v;
        cin>>u>>v;
        if (u>v) swap(u,v);
        if (u==v) d[u]++;
        else edges[{u,v}]++, d[u]++, d[v]++;
    }
    rep1(i,n) cnt[d[i]]++, sum[d[i]]++;
    for (int i=m;i>0;--i) sum[i-1]+=sum[i];
    vi cand;
    for (int i=500002;i<=1000001;++i){
        if (cnt[i]) cand.pb(i);
    }
    for (int i=1000002;i>0;i-=2){
        if (cnt[i/2]) cand.pb(i/2);
        for (auto c:cand){
            ans[i]+=cnt[c]*(i-c>=0?sum[i-c]-sum[c]:n-sum[c]);
            ans[i-1]+=cnt[c]*(i-1-c>=0?sum[i-1-c]-sum[c]:n-sum[c]);
            ans[i]+=cnt[c]*(cnt[c]-1)/2;
            ans[i-1]+=cnt[c]*(cnt[c]-1)/2;
        }
    }
    for (auto c:edges){
        int u=c.F.F, v=c.F.S, w=c.S;
        for (int i=0;i<w;++i) ans[d[u]+d[v]-i]--;
    }
    int _;
    cin>>_;
    while (_--){
        int k;
        cin>>k;
        cout<<ans[k+1]<<"\n";
    }
    return 0;
}

/*
5 3 
3 0 2 3 
3 3 0 1
4 0 1 3 4

2 0 3 1 4

1 0 3 4 
*/