//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#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 MAX 500005
#define pb push_back
// #define mp make_pair
#define int long long
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define vpii vector<pair<int,int>>
const int mod = 1e9+7;
const int INF = 1e18;
// myMap.begin()->first : key
// myMap.begin()->second : value
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;b>>=1;ans%=mod;a%=mod;}return ans%mod;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod))%mod;}
// int sum(int a,int b){return ((a%mod)+(b%mod))%mod;}
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
// typedef
// tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_multiset;
vi sz(1003),arr(1005),adj[1005],vis(1005);
int dp[1003][1003][3];
void dfs(int node,int par){
sz[node]=1; vis[node]=1;
dp[node][0][0]=0;
dp[node][0][1]=arr[node];
for(auto u : adj[node]){
if(u==par) continue;
dfs(u,node);
for(int i=sz[node];i>=0;i--){
for(int j=0;j<=sz[u];j++){
dp[node][i+j][0]=min(dp[node][i+j][0], dp[node][i][0]+min({dp[u][j][0],dp[u][j][1],dp[u][j][2]}) );
dp[node][i+j][1]=min(dp[node][i+j][1], dp[node][i][1]+dp[u][j][0] );
dp[node][i+j][2]=min(dp[node][i+j][2], dp[node][i][2]+min(dp[u][j][0],dp[u][j][2]) );
dp[node][i+j+1][2]=min({dp[node][i+j+1][2],dp[node][i][1]+dp[u][j][2], dp[node][i][2]+dp[u][j][1] });
dp[node][i+j+2][2]=min(dp[node][i+j+2][2],dp[node][i][1]+dp[u][j][1]);
}
}
sz[node]+=sz[u];
}
}
void solve(){
int n,m; cin>>n>>m;
for(int i=0;i<=n;i++){
for(int j=0;j<=n;j++) dp[i][j][0]=dp[i][j][1]=dp[i][j][2]=INF;
}
for(int i=1;i<=n;i++) cin>>arr[i];
for(int i=1;i<=m;i++){
int a,b; cin>>a>>b;
adj[a].pb(b); adj[b].pb(a);
}
vi v;
for(int i=1;i<=n;i++){
if(!vis[i]) dfs(i,0),v.pb(i);
}
// for(auto u : v) cout<<u<<" ";cout<<" 23\n";
// for(int i=1;i<=n;i++){
// cout<<i<<": \n";
// for(int j=1;j<=2;j++) cout<<dp[i][j][0]<<" "<<dp[i][j][1]<<endl;
// cout<<endl;
// }
// for(int i=0;i<=n;i++) cout<<min({dp[1][i][0],dp[1][i][1],dp[1][i][2]})<<endl;
vi dp2(1005,INF); dp2[0]=0; int len=1;
for(auto node : v){
for(int i=len;i>=0;i--){
for(int k=0;k<=sz[node];k++){ // min(sz[v[i]],j)
dp2[i+k]=min(dp2[i+k], dp2[i]+min({dp[node][k][0],dp[node][k][1],dp[node][k][2]}) );
}
}
len+=sz[node];
}
// for(int i=0;i<=n;i++) cout<<(int)dp2[v.size()-1][i]<<" ";cout<<endl;
dp2[1]=dp2[2];
int q; cin>>q;
while(q--){
int val; cin>>val;
int l=0,r=n;
while(l<=r){
int mid=(l+r)>>1;
if(dp2[mid]<=val) l=mid+1;
else r=mid-1;
}
cout<<r<<endl;
}
}
int32_t main(/*int32_t argc, char* argv[]*/){
std::ios_base::sync_with_stdio(0); std::cin.tie(0);
// freopen("disconnected.in", "r", stdin);
// freopen("disconnected.out", "w", stdout);
int t=1;
// cin >> t;
while (t--) solve();
return 0;
}
