/*
题意：略

初步思路：找出强连通，然后贪心
*/
#include<bits/stdc++.h>
using namespace std;
int cost[2007];
int u[2007],v[2007];
int allcost=0;
int vis[2007];
int money[2007];
/**************************强连通模板******************************/
const int maxn = 2000 + 7;
vector<int> G[maxn];
int n, m, k = 0, cnt = 0;
int low[maxn];
int dfn[maxn];
int in[maxn];
stack<int> s;

void tarjan(int u) {
    low[u] = dfn[u] = ++k;
    s.push(u);
    for(int i = 0; i < G[u].size(); ++i) {
        int v = G[u][i];
        if(!dfn[v]) {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        } else if(!in[v]) {
            low[u] = min(low[u], dfn[v]);
        }
    }
    int v;
    if(dfn[u] == low[u]) {
        cnt++;
        do {
            v = s.top(); s.pop();
            in[v] = cnt;
        } while(u != v);
    }
}
/**************************强连通模板******************************/
void init(){
    for(int i=1;i<=n;i++){
        G[i].clear();
    }
    k = 0, cnt = 0;
    memset(dfn,0,sizeof dfn);
    memset(low,0,sizeof low);
    memset(money,0x3f3f,sizeof money);
    memset(in,0,sizeof in);
    while(!s.empty()) s.pop();
    allcost=0;
}
int main(){
    // freopen("in.txt","r",stdin);
    while(scanf("%d%d",&n,&m)!=EOF){
        init();
        for(int i=1;i<=n;i++){
            scanf("%d",&cost[i]);
        }
        for(int i=0;i<m;i++){
            scanf("%d%d",&u[i],&v[i]);
            G[u[i]].push_back(v[i]);
        }
        for(int i=1;i<=n;i++){
            if(!dfn[i]) tarjan(i);
        }
        for(int i=1;i<=n;i++){
            money[in[i]]=min(cost[i],money[in[i]]);
        }
        
        for(int i=1;i<=cnt;i++){
            vis[i]=1;
        }
        
        for(int i=0;i<m;i++){
        if(in[u[i]]!=in[v[i]])
            vis[in[v[i]]] = 0;
        }
        
        int ans=0;
        for(int i=1;i<=cnt;i++){
            if(vis[i]){
                ans++;
                allcost+=money[i];
            }
        }
        // for(int i=1;i<=n;i++){
            // cout<<vis[i]<<" ";
        // }
        // cout<<endl;
        
        printf("%d %d\n",ans,allcost);
    }
    return 0;
}