#include <iostream>

 #include <cstdio>

 #include <algorithm>

 #include <cstring>

 #include <vector>

 #include <stack>

 using namespace std;

 const int maxn =  + ;

 int n, m;

 int w[maxn], cost[maxn];

 vector<int> G[maxn];

 stack<int> S;

 int pre[maxn], lowlink[maxn], sccno[maxn];

 int dfs_clock, scc_cnt;

 void dfs(int u)

 {

     pre[u] = lowlink[u] = ++dfs_clock;

     S.push(u);

     for(int i = ; i < G[u].size(); i++)

     {

         int v = G[u][i];

         if(!pre[v])

         {

             dfs(v);

             lowlink[u] = min(lowlink[u], lowlink[v]);

         }

         else if(!sccno[v]) lowlink[u] = min(lowlink[u], pre[v]);

     }

     if(lowlink[u] == pre[u])

     {

         scc_cnt++;

         for(;;)

         {

             int x = S.top(); S.pop();

             sccno[x] = scc_cnt;

             if(x == u) break;

         }

     }

 }

 void find_scc()

 {

     dfs_clock = scc_cnt = ;

     memset(sccno, , sizeof(sccno));

     memset(pre, , sizeof(pre));

     for(int i = ; i <= n; i++) if(!pre[i]) dfs(i);

 }

 int indeg[maxn];

 int main()

 {

     while(scanf("%d%d", &n, &m) == )

     {

         for(int i = ; i <= n; i++) G[i].clear();

         for(int i = ; i <= n; i++) scanf("%d", w + i);

         while(m--)

         {

             int u, v; scanf("%d%d", &u, &v);

             G[u].push_back(v);

         }

         find_scc();

         memset(cost, 0x3f, sizeof(cost));

         for(int i = ; i <= n; i++) cost[sccno[i]] = min(cost[sccno[i]], w[i]);

         memset(indeg, , sizeof(indeg));

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

         {

             for(int j = ; j < G[i].size(); j++)

             {

                 int u = sccno[i], v = sccno[G[i][j]];

                 if(u == v) continue;

                 indeg[v]++;

             }

         }

         int ans1 = , ans2 = ;

         for(int i = ; i <= scc_cnt; i++) if(!indeg[i]) { ans1++; ans2 += cost[i]; }

         printf("%d %d\n", ans1, ans2);

     }

     return ;

 }