#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 1e3 + 5;
int n, m, q, d[N], sz[N];
vector <int> adj[N];
int dp[N][3][N]; // dp[i][j][k] = min cost when check subtree i,
// in state j (0 = not relaxed, 1 = relaxed, 2 = already exchanged)
// k people exchanged
int dfs(int u, int p){
sz[u] = 1;
dp[u][0][0] = 0;
dp[u][1][0] = d[u];
for (auto v : adj[u]) {
if (v == p) continue;
sz[u] += dfs(v, u);
for (int i = sz[u]; i >= 1; i--) {
for (int j = 0; j <= min(i, sz[v] + 2); j++) {
dp[u][0][i] = min(dp[u][0][i], dp[u][0][i - j] + min({dp[v][0][j], dp[v][1][j], dp[v][2][j]}));
dp[u][1][i] = min(dp[u][1][i], dp[u][1][i - j] + dp[v][0][j]);
dp[u][2][i] = min({dp[u][2][i], dp[u][1][i - j] + min(dp[v][2][max(0ll, j - 1)], dp[v][1][max(0ll, j - 2)]), dp[u][2][i - j] + min({dp[v][0][j], dp[v][2][j], dp[v][1][max(0ll, j - 1)]})});
}
}
}
return sz[u];
}
int32_t main(){
// iShowSpeed;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= n; j++) {
dp[i][0][j] = dp[i][1][j] = dp[i][2][j] = inf;
}
dp[i][2][0] = inf;
}
for (int i = 1; i <= n; i++) cin >> d[i];
for (int i = 1; i <= m; i++) {
int u, v; cin >> u >> v;
adj[u].emb(v);
adj[v].emb(u);
}
dfs(1, 1);
cin >> q;
while (q--) {
int s; cin >> s;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (min({dp[1][0][i], dp[1][1][i], dp[1][2][i]}) <= s) ans = i;
}
cout << ans << "\n";
}
}
/*
subtask 1,2?
dp[u][0][i] = min()
*/
