//In The Name Of ALLAH!
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
#define endl '\n'
#define pb push_back
#define pf push_front
#define Zemur007 ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define bpc __builtin_popcountll
#define btz __builtin_ctzll
#define all(x) x.begin() , x.end()
#define allr(x) x.rbegin() , x.rend()
#define F first
#define S second
#define pii pair<int , int>
#define pll pair<ll , ll>
#define turtle tuple<ll , ll , ll>
#define pss pair<string , string>
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define indexed_set tree<pll , null_type , less<pll> , rb_tree_tag , tree_order_statistics_node_update>
const ll sz = 1e3 + 5 , INF = 1e18 , MOD = 998244353;
ll a[sz] , b[sz] , dis[sz] , dp[sz][sz][3] , ans[sz] , timer;
vector<ll> g[sz];
void dfs(ll n , ll p){
++timer;
b[timer] = a[n];
for(ll i : g[n]){
if(i != p){
dfs(i , n);
}
}
}
ll mask , i , j , k;
void solve(){
ll n , m; cin >> n >> m;
for(i = 1 ; i <= n ; i++) cin >> a[i];
for(i = 1 ; i <= m ; i++){
ll u , v; cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
for(i = 1 ; i <= n ; i++){
if(g[i].size() == 1){
timer = 0;
dfs(i , -1);
break;
}
}
//dp[i][j][k] -> i-ə qədər gəldik j nefer dzumbusz paylasirsa varsa
//k = 0 -> götürmürük
//k = 1 -> yeni component başladırıq
//k = 2 -> əvvəlin davam elətdiririk
//onda minimum cost
for(i = 0 ; i <= n ; i++){
for(j = 0 ; j <= n ; j++){
dp[i][j][0] = dp[i][j][1] = dp[i][j][2] = INF;
}
}
dp[0][0][0] = 0;
for(i = 1 ; i <= n ; i++){
for(j = 0 ; j <= i ; j++){
dp[i][j][0] = min({dp[i][j][0] , dp[i - 1][j][0] , dp[i - 1][j][2]});
dp[i][j][1] = min(dp[i][j][1] , dp[i - 1][j][0] + b[i]);
if(j >= 1) dp[i][j][2] = min(dp[i][j][2] , dp[i - 1][j - 1][2] + b[i]);
if(j >= 2) dp[i][j][2] = min(dp[i][j][2] , dp[i - 1][j - 2][1] + b[i]);
}
}
for(i = 0 ; i <= n ; i++) ans[i] = min(dp[n][i][0] , dp[n][i][2]);
for(i = n - 1 ; i >= 0 ; i--) ans[i] = min(ans[i] , ans[i + 1]);
//3 4 1 5 2
ll q; cin >> q;
while(q--){
ll x; cin >> x;
cout << upper_bound(ans , ans + n + 1 , x) - ans - 1 << endl;
}
}
/*
5 4
1 4 5 3 2
1 2
1 3
2 4
3 5
3
8
10
12
*/
signed main(){
Zemur007;
// open();
#ifdef LOCAL
freopen("output.txt","w",stdout);
#endif
ll t = 1;
// cin >> t;
while(t--){
solve();
}
// for(ll testcase = 1 ; testcase <= t ; testcase++){
// cout << "Case " << testcase << ":" << endl;
// solve();
// }
}
