// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Your shadow Gets in the way of my light
uint P[25],E[25];
llt Ans[1u<<20|1];
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint n,m;
    while(scanf("%u%u",&n,&m)==2&&n)
    {
        for(uint i=0;i<n;i++)scanf("%u",P+i),E[i]=0;
        std::sort(P,P+n);
        while(m--)
        {
            uint u,v;scanf("%u%u",&u,&v),u--,v--;
            E[u]|=1u<<v,E[v]|=1u<<u;
        }
        for(uint i=1;i<(1u<<n);i++)
        {
            Ans[i]=1e18;
            uint r=__builtin_popcount(i);
            for(uint j=0;j<n;j++)if(i>>j&1)
            {
                _min<llt>(Ans[i],Ans[i^(1u<<j)]+(llt)P[r-1]*__builtin_popcount(E[j]&i)
                                                -(llt)P[r-1]*__builtin_popcount(E[j]&~i));
            }
            // printf(":%lld\n",Ans[i]);
        }
        printf("%lld\n",Ans[(1u<<n)-1]);
    }
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。