#include <bits/stdc++.h>
/*
--> Author: Kazuki_Hoshino__8703 <--
I love Nanasaki Ai ☆*: .｡. o(≧▽≦)o .｡.:*☆
*/
#define fi first
#define se second
#define pii pair<int, int>
#define int long long
using namespace std;
const int mn = 1e3 + 5;
const int inf = 1e18;
int n, m, q;
int d[mn], sz[mn];
bool vst[mn];
int dp[mn][mn][3], tmp[mn][3];
vector <int> a[mn];
// dp[0][u][i]: Ko chọn u
// dp[1][u][i]: Ghép với con
// dp[2][u][i]: Ghép với bố
void dfs(int u, int p){
vst[u] = 1;
sz[u] = 1;
dp[u][0][0] = 0;
dp[u][1][2] = dp[u][1][1] = d[u];
for(auto v : a[u]){
if(v == p) continue;
dfs(v, u);
for(int i = sz[u]; i >= 0; i--){
for(int j = sz[v]; j >= 1; j--){
if(i < sz[u]) dp[u][i + j][0] = min(dp[u][i + j][0], dp[u][i][0] + min(dp[v][j][0], dp[v][j][1]));
if(i >= 1) dp[u][i + j][1] = min(dp[u][i + j][1], min(dp[u][i][1], dp[u][i][2]) + min(dp[v][j][2], dp[v][j][1]));
if(i > 1) dp[u][i + j][1] = min(dp[u][i + j][1], dp[u][i][1] + dp[v][j][0]);
}
}
for(int i = sz[u]; i >= 1; i--){
for(int j = sz[v]; j >= 1; j--){
dp[u][i + j][2] = min(dp[u][i + j][2], dp[u][i][2] + dp[v][j][0]);
}
}
sz[u] += sz[v];
}
dp[u][1][1] = inf;
}
int f[mn];
void solve(){
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> d[i];
}
for(int i = 1; i <= m; i++){
int u, v; cin >> u >> v;
a[u].push_back(v);
a[v].push_back(u);
}
fill(&dp[0][0][0], &dp[0][0][0] + mn * mn * 3, inf);
for(int i = 0; i <= n; i++) f[i] = inf;
f[0] = 0;
int sum = 0;
for(int u = 1; u <= n; u++){
if(!vst[u]){
dfs(u, -1);
for(int i = sum; i >= 0; i--){
if(i == 1) continue;
for(int j = sz[u]; j >= 2; j--){
f[i + j] = min(f[i + j], f[i] + min(dp[u][j][0], dp[u][j][1]));
}
}
sum += sz[u];
}
}
cin >> q;
while(q--){
int s; cin >> s;
int it = upper_bound(f + 1, f + n + 1, s) - f - 1;
cout << (it < 2 ? 0 : it) << "\n";
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
while(t--){
solve();
}
}
