#include <bits/stdc++.h>
using namespace std;
const int N = 2e4+10,M = 1e5+10;
int n,m,ans = INT_MAX;
struct made{
    int ver,nx;
}e[M];
int hd[N],tot;
int a[N],v[N];
void add(int x,int y){
    tot++;
    e[tot].ver = y,e[tot].nx = hd[x],hd[x] = tot;
}
bool check(){
    for(int i = 1;i <= n;i++)
        if(!v[i])return 0;
    return 1;
}
void dfs(int x,int u){
    v[x] += u;
    for(int i = hd[x];i;i = e[i].nx){
        int y = e[i].ver;
        v[y] += u;
    }
}
void sou(int x,int s){
    if(s > ans)return;
    if(check()){
        ans = min(ans,s);
        return;
    }
    if(x == n+1)return;
    dfs(x,1);
    sou(x+1,s+a[x]);
    dfs(x,-1);
    sou(x+1,s);
}
int main(){
    freopen("cogito.in","r",stdin);
    freopen("cogito.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i = 1;i <= n;i++)scanf("%d",&a[i]);
    for(int i = 1;i <= m;i++){
        int x,y;
        scanf("%d%d",&x,&y);
        add(x,y);
        add(y,x);
    }
    sou(1,0);
    printf("%d\n",ans);
    
    return 0;
    
}