//minamoto

 #include<iostream>

 #include<cstdio>

 using namespace std;

 #define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)

 char buf[<<],*p1=buf,*p2=buf;

 template<class T>inline bool cmin(T&a,const T&b){return a>b?a=b,:;}

 template<class T>inline bool cmax(T&a,const T&b){return a<b?a=b,:;}

 inline int read(){

     #define num ch-'0'

     char ch;bool flag=;int res;

     while(!isdigit(ch=getc()))

     (ch=='-')&&(flag=true);

     for(res=num;isdigit(ch=getc());res=res*+num);

     (flag)&&(res=-res);

     #undef num

     return res;

 }

 const int N=,M=,SS=,inf=0x3f3f3f3f;

 int head[N],Next[M],ver[M],tot;

 int a[N],f[][SS],dep[N],vis[N],q[N],bin[],top,n,m,res;

 inline void add(int u,int v){ver[++tot]=v,Next[tot]=head[u],head[u]=tot;}

 inline int get(int S,int dep){return S/bin[dep]%;}

 void dfs(int u,int d){

     dep[u]=d,vis[u]=;

     if(!d) f[][]=a[u],f[][]=,f[][]=inf;

     else{

         top=;

         for(int i=head[u];i;i=Next[i])

         if(vis[ver[i]]&&dep[ver[i]]<d) q[++top]=dep[ver[i]];

         for(int S=;S<bin[d+];++S) f[d][S]=inf;

         for(int S=bin[d]-;~S;--S){

             int U=,V=S;

             for(int i=;i<=top;++i){

                 int x=get(S,q[i]);

                 if(x==) U=;

                 else if(x==) V+=bin[q[i]];

             }

             cmin(f[d][S+U*bin[d]],f[d-][S]);

             cmin(f[d][V],f[d-][S]+a[u]);

         }

     }

     for(int i=head[u];i;i=Next[i]){

         int v=ver[i];

         if(!vis[v]){

             dfs(v,d+);

             for(int S=;S<bin[d+];++S)

             f[d][S]=min(f[d+][S],f[d+][S+*bin[d+]]);

         }

     }

 }

 int main(){

 //    freopen("testdata.in","r",stdin);

     bin[]=;for(int i=;i<=;++i) bin[i]=bin[i-]*;

     n=read(),m=read();

     for(int i=;i<=n;++i) a[i]=read();

     for(int i=,u,v;i<=m;++i)

     u=read(),v=read(),add(u,v),add(v,u);

     for(int i=;i<=n;++i)

     if(!vis[i]) dfs(i,),res+=min(f[][],f[][]);

     printf("%d\n",res);

     return ;

 }