1 #include <cstdio>
  2 #include <cstring>
  3 #include <stack>
  4 #define min(x,y) (x < y ? x : y)
  5 #define MAX 2002
  6 #define INF 1000000000
  7 using namespace std;
  8 
  9 int n,m,id,index;
 10 int p[MAX>>1];
 11 int c[MAX>>1];
 12 int belong[MAX>>1];
 13 int dfn[MAX>>1],low[MAX>>1];
 14 bool instack[MAX>>1];
 15 
 16 stack<int> s;
 17 typedef struct{
 18     int from;
 19     int to;
 20     int next;
 21 }Edge;
 22 Edge e[MAX];
 23 int tot;
 24 int in[MAX>>1],les[MAX>>1];
 25 
 26 void add(int u,int v){
 27     e[tot].next=p[u];   e[tot].from=u;  e[tot].to=v;    p[u]=tot++;
 28 }
 29 
 30 void reset(){
 31     id=0;
 32     index=0;
 33     while(!s.empty()) s.pop();
 34     memset(c,0,sizeof(c));
 35     memset(p,-1,sizeof(p));
 36     memset(e,0,sizeof(e));
 37     memset(belong,0,sizeof(belong));
 38     memset(dfn,0,sizeof(dfn));
 39     memset(low,0,sizeof(low));
 40     memset(in,0,sizeof(in));
 41     memset(instack,0,sizeof(instack));
 42     tot=0;
 43 }
 44 
 45 void tarjan(int u){
 46     dfn[u]=low[u]=++id;
 47     s.push(u);
 48     instack[u]=1;
 49     for(int v=p[u];v!=-1;v=e[v].next){
 50         if(dfn[e[v].to]==0){
 51             tarjan(e[v].to);
 52             low[u]=min(low[u],low[e[v].to]);
 53         }else if(instack[e[v].to]){
 54             low[u]=min(low[u],dfn[e[v].to]);
 55         }
 56     }
 57     if(dfn[u]==low[u]){
 58         int v;
 59         index++;
 60         les[index]=c[u];
 61         do{
 62             v=s.top();
 63             belong[v]=index;
 64             les[index]=min(les[index],c[v]);
 65             instack[v]=0;
 66             s.pop();
 67         }while(u!=v);
 68     }
 69 }
 70 
 71 int main()
 72 {
 73     int x,y,minn,count;
 74     //freopen("data.txt","r",stdin);
 75     while(scanf("%d %d",&n,&m)!=EOF){
 76         reset();
 77         for(int i=1;i<=n;i++){
 78                 scanf("%d",&c[i]);
 79         }
 80         for(int i=1;i<=m;i++){
 81                 scanf("%d %d",&x,&y);
 82                 add(x,y);
 83         }
 84         for(int i=1;i<=n;i++){
 85             if(dfn[i]<=0) tarjan(i);
 86         }
 87         for(int i=0;i<tot;i++){
 88             int u,v;
 89             u=belong[e[i].from];
 90             v=belong[e[i].to];
 91             if(u!=v){
 92                 in[v]++;
 93             }
 94         }
 95         minn=0;
 96         count=0;
 97         for(int i=1;i<=index;i++){
 98             if(in[i]==0){
 99                 minn+=les[i];
100                 count++;
101             }
102         }
103         printf("%d %d\n",count,minn);
104     }
105     return 0;
106 }