#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cmath>

 #include<iostream>

 #include<queue>

 using namespace std;

 #define LL long long

 const int maxn=;

 const LL minf=(LL)1e11;

 int n,m,s,t;

 LL val[maxn]={};

 struct nod{

     int y,next;LL v;

 }e[];

 int head[maxn]={},tot=,dep[maxn]={};

 queue<int>q;

 bool vis[maxn]={}; int cnt=;

 void init(int x,int y,LL v){

     e[++tot].y=y;e[tot].v=v;e[tot].next=head[x];head[x]=tot;

 }

 int bfs(){

     q.push(s);

     memset(dep,,sizeof(dep));

     dep[s]=;

     while(!q.empty()){

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

         for(int i=head[x];i;i=e[i].next){

             if(e[i].v&&(!dep[e[i].y])){

                 dep[e[i].y]=dep[x]+;

                 q.push(e[i].y);

             }

         }

     }

     return dep[t];

 }

 LL dfs(int x,LL fc){

     if(x==t)return fc;

     LL tsn=;

     for(int i=head[x];i;i=e[i].next){

         if(e[i].v&&dep[e[i].y]==dep[x]+){

             LL z=dfs(e[i].y,min(fc-tsn,e[i].v));

             tsn+=z;e[i].v-=z;e[i^].v+=z;

             if(tsn==fc)break;

         }

     }

     return tsn;

 }

 LL dinic(){

     LL tsn=;

     while(bfs())tsn+=dfs(s,minf);

     return tsn;

 }

 void getit(int x){

     if(x==t)return;

     if(x!=s)++cnt;

     vis[x]=;

     for(int i=head[x];i;i=e[i].next){

         if(e[i].v&&!vis[e[i].y]){

             getit(e[i].y);

         }

     }

 }

 int main(){

     scanf("%d%d",&n,&m);

     s=n+;t=s+;

     LL ans=;

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

         scanf("%lld",&val[i]);

         if(val[i]>=){init(s,i,val[i]); init(i,s,); ans+=val[i];}

         else{init(i,t,-val[i]);init(t,i,);}

     }

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

         int x,y;

         scanf("%d%d",&x,&y);

         init(x,y,minf);init(y,x,);

     }

     ans-=dinic();

     getit(s);

     printf("%d ",cnt);

     printf("%lld\n",ans);

     return ;

 }