#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}


inline char gc() { // like getchar()
	static char buf[1 << 16];
	static size_t bc, be;
	if (bc >= be) {
		buf[0] = 0, bc = 0;
		be = fread(buf, 1, sizeof(buf), stdin);
	}
	return buf[bc++]; // returns 0 on EOF
}
int readInt() {
	int a, c;
	while ((a = gc()) < 40);
	if (a == '-') return -readInt();
	while ((c = gc()) >= 48) a = a * 10 + c - 480;
	return a - 48;
}


const int maxn=1e5+10;
ll inf=1e18;

struct edge{
    int u,v;
    ll f,c;
};
vector<edge>e;
vector<int>vect[maxn];
int n,m,start[maxn],level[maxn],pos[maxn];
int sink,source;

void add_edge(int u,int v,ll c){

    ///printf("%d %d | %lld AA\n",u,v,c);

    vect[u].pb(e.size());
    e.pb({u,v,0,c});

    vect[v].pb(e.size());
    e.pb({v,u,c,c});
}

int bfs(){

    memset(level,0,sizeof(level));
    queue<int>q;

    level[source]=1;
    q.push(source);
    while(q.size()){

        int x=q.front();
        q.pop();

        for(int i=0;i<vect[x].size();i++){
            int id=vect[x][i];
            if(e[id].f==e[id].c || level[e[id].v])continue;
            level[e[id].v]=level[x]+1;
            q.push(e[id].v);
        }

    }

    return level[sink];
}
ll send_flow(int x,ll flow){

    if(x==sink)return flow;

   /// printf("%d %lld XX\n",x,flow);

    for(;start[x]<vect[x].size();start[x]++){

        int id=vect[x][start[x]];

       /// printf("USO %d | %lld %lld | %d %d\n",id,e[id].f,e[id].c,level[x],level[e[id].v]);

        if(e[id].f<e[id].c && level[x]+1==level[e[id].v]){

            ll tmp=send_flow(e[id].v,min(flow,e[id].c-e[id].f));

            if(tmp){

                e[id].f+=tmp;
                e[id^1].f-=tmp;

                return tmp;
            }

        }

    }

    return 0;
}
ll go(){

    ll ret=0;
    while(bfs()){
        ///printf("opa %lld\n",ret);
        memset(start,0,sizeof(start));
        ll pom=0;
        while(pom=send_flow(source,inf)){
            ret+=pom;
        }
    }
    return ret;
}

void dodaj(int u,vector<int>&rez){
    if(u>source && u<sink)rez.pb(u);
}

int main(){

    //cin.tie(0);
    //ios_base::sync_with_stdio(0);


    freopen("dodgeball.in","r",stdin);
    freopen("dodgeball.out","w",stdout);

    n=readInt();
    m=readInt();
    ll sum=0;
    source=0;
    sink=n+1;
    for(int i=1;i<=n;i++){
        int a=readInt();
        sum+=a;
        if(i%2==0)add_edge(source,i,a);
        else add_edge(i,sink,a);
    }
    for(int i=1;i<=m;i++){
        int u,v;
        u=readInt();
        v=readInt();
        ///scanf("%d %d",&u,&v);
        if(u%2==0){}
        else swap(u,v);
        add_edge(u,v,inf);
    }

    ///printf("%lld GO\n",go());
    ll pom=go();
    sum-=pom;

    vector<int>rez;

    for(edge p:e){

        int u=p.u;
        int v=p.v;
        ll ff=p.f;
        ll cc=p.c;

        if(level[u]>0 && level[v]==0){
            dodaj(u,rez);
            dodaj(v,rez);

        }
    }
    for(int i=0;i<rez.size();i++)pos[rez[i]]=1;
    rez.clear();
    for(int i=1;i<=n;i++)if(!pos[i])rez.pb(i);


    printf("%lld\n",sum);
    printf("%d\n",rez.size());
    for(int i=0;i<rez.size();i++){
        printf("%d ",rez[i]);
    }
    printf("\n");


    return 0;
}