#include <cstdio>

#include <iostream>

using namespace std;

const int N = 1e6+;

const int md = 1e9+;

int n, head[N << ], cnt,  w[N], m, dfn[N], low[N], tot, top, stac[N], ans, minn, sum = , geshu;

bool vis[N];

struct node {

    int nxt, to;

}e[N << ];

int read() {

    int s = , w = ;

    char ch = getchar();

    while(!isdigit(ch)) {if(ch == '-') w = -; ch = getchar();}

    while(isdigit(ch)) {s = s *  + ch - ''; ch = getchar();}

    return s * w;

}

void add(int x, int y) {

    e[++cnt].nxt = head[x];

    e[cnt].to = y;

    head[x] = cnt;

}

void tarjan(int u) {

    dfn[u] = low[u] = ++tot, stac[++top] = u, vis[u] = ;

    for(int i = head[u]; i; i = e[i].nxt) {

        int v = e[i].to;

        if(!dfn[v]) tarjan(v), low[u] = min(low[u], low[v]);

        else if(vis[v]) low[u] = min(low[u], dfn[v]);

    }

    if(dfn[u] == low[u]) {

        geshu = ,     minn = 0x3f3f3f3f;

        while(stac[top] != u) {

            vis[stac[top]] = ;

            if(w[stac[top]] < minn) minn = w[stac[top]], geshu = ;

            if(w[stac[top--]] == minn) geshu++;

        }

        top--, vis[u] = ;

        if(w[u] < minn) minn = w[u], geshu = ;

        else if(w[u] == minn) geshu++;

        ans += minn;

        sum = (sum * geshu) % md;

    }

}

int main() {

    n = read();

    for(int i = ; i <= n; i++) w[i] = read();

    m = read();

    for(int i = , x, y; i <= m; i++) {

        x = read(), y = read();

        add(x, y);

    }

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

        if(!dfn[i]) tarjan(i);

    printf("%d %d\n", ans, sum);

    return ;

}