#include<bits/stdc++.h> using namespace std; #define int long long int n,m; int a[200005]; vector<int>gp[200005]; int sum[200005],vis[200005],ssum[200005]; bool check(int mid){ queue<int>q; for(int i=1;i<=n;i++){ vis[i]=0; ssum[i]=sum[i]; if(sum[i]<=mid){ q.push(i); vis[i]=1; } } while(!q.empty()){ int qf=q.front(); q.pop(); for(auto it:gp[qf]){ if(vis[it])continue; ssum[it]-=a[qf]; if(ssum[it]<=mid){ q.push(it); vis[it]=1; } } } for(int i=1;i<=n;i++)if(!vis[i])return false; return true; } signed main(){ // freopen("del.in","r",stdin); // freopen("del.out","w",stdout); cin>>n>>m; for(int i=1;i<=n;i++)cin>>a[i]; for(int i=1;i<=m;i++){ int u,v; cin>>u>>v; gp[u].push_back(v); gp[v].push_back(u); } for(int i=1;i<=n;i++)for(auto it:gp[i])sum[i]+=a[it]; int l=1,r=1e18; while(l<r){ int mid=(l+r)>>1; if(check(mid))r=mid; else l=mid+1; } cout<<l; return 0; } /* 思路： */