#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e3 + 5, INF = 4e18;
int n, m, q, d[N], dp[N][N], dp1[N][N], dp2[N][N], mn[N];
vector<int> adj[N];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for(int i = 1;i<=n;i++) cin >> d[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> od;
if(n == 1) od.push_back(1);
else{
int st = -1;
for(int i = 1;i<=n;i++){
if(adj[i].size() == 1){
st = i;
break;
}
}
int pv = 0;
while(1){
od.push_back(st);
int nxt = 0;
for(auto x : adj[st]) if(x != pv) nxt = x;
if(nxt == 0) break;
pv = st;
st = nxt;
}
}
memset(dp, 0x3f, sizeof dp); memset(dp1, 0x3f, sizeof dp1); memset(dp2, 0x3f, sizeof dp2);
dp[0][0] = 0;
for(int i = 1;i<=n;i++){
dp[i][0] = 0;
for(int j = 0;j<=n;j++){
dp[i][j] = min({dp[i - 1][j], dp1[i - 1][j], dp2[i - 1][j]});
dp1[i][j] = dp[i - 1][j] + d[od[i - 1]];
dp2[i][j] = INF;
if(j >= 1) dp2[i][j] = min(dp2[i][j], dp2[i - 1][j - 1] + d[od[i - 1]]);
if(j >= 2) dp2[i][j] = min(dp2[i][j], dp1[i - 1][j - 2] + d[od[i - 1]]);
}
}
for(int i = 1;i<=n;i++){
mn[i] = min(dp[n][i], dp2[n][i]);
}
cin >> q;
while(q--){
int x; cin >> x;
int ans = 0;
for(int i = 0;i<=n;i++){
if(mn[i] <= x) ans = i;
}
cout << ans << '\n';
}
}
