//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 1e6 + 10, M = 1e7 + 10;
const double eps = 1e-7;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b, ll m) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % m;
}
b >>= 1;
a = (a * a) % m;
}
return res;
}
int n, m;
ll a[N], answ[N];
ll ans = 0;
vector<int>adj[N];
bool active[N];
struct DSU{
int sz[N], par[N];
void init(){
for(int i = 1; i <= n; i++){
sz[i] = 1;
par[i] = i;
}
}
int find(int a){
if(par[a] == a) return a;
return par[a] = find(par[a]);
}
bool merge(int a, int b){
a = find(a), b = find(b);
if(a == b) return 0;
if(sz[a] > sz[b]) swap(a, b);
par[a] = b;
if(sz[b] > 1) ans -= sz[b];
if(sz[a] > 1) ans -= sz[a];
sz[b] += sz[a];
sz[a] = 0;
ans += sz[b];
return 1;
}
}dsu;
void solve(int tc) {
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
for(int i = 0; i < m; i++){
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
vector<int>ord(n);
iota(all(ord), 1);
sort(all(ord), [](int i, int j){
return a[i] < a[j];
});
dsu.init();
vector<pair<ll,int>>qry;
int q;
cin >> q;
for(int i = 0; i < q; i++){
ll x;
cin >> x;
qry.push_back({x, i});
}
sort(all(qry));
int it = 0;
ll s = 0;
for(auto [x, id] : qry){
int pre = it;
while(it < n && s + a[ord[it]] <= x){
s += a[ord[it]];
active[ord[it]] = 1;
it++;
}
for(int j = pre; j < it; j++){
for(auto i : adj[ord[j]]){
if(active[i]){
dsu.merge(i, ord[j]);
dbg(ans);
}
}
}
answ[id] = ans;
}
for(int i = 0; i < q; i++){
cout << answ[i] << endl;
}
}
void precalc() {
}
int main() {
// SetIO("teamwork");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--) {
solve(cnt++);
}
return 0;
}
