#include<bits/stdc++.h>
#define ing long long
using namespace std;
const int N=1e9+7;
int n,m,buy[100005],dfn[100005],low[100005],cnt,in[100005],cnt1,use[100005],answer,ans=1;
vector<int> f[100005],a[100005];
stack<int> st;
void dfs(int x)
{
	dfn[x]=low[x]=++cnt;
	st.push(x); in[x]=1;
	for(register int i=0;i<f[x].size();++i)
	{
		int to=f[x][i];
		if(dfn[to]==0) { dfs(to); low[x]=min(low[x],low[to]); }
		if(in[to]==1) low[x]=min(low[x],dfn[to]);
	}
	if(dfn[x]==low[x])
	{
		cnt1++;
		use[cnt1]=1e9+5;
		while(!st.empty()&&st.top()!=x)
		{
			in[st.top()]=0;
			a[cnt1].push_back(st.top());
			use[cnt1]=min(use[cnt1],buy[st.top()]);
			st.pop();
		}
		in[st.top()]=0;
		a[cnt1].push_back(st.top());
		use[cnt1]=min(use[cnt1],buy[st.top()]);
		st.pop();
	}
}
signed main()
{
	cin>>n;
	for(register int i=1;i<=n;++i) cin>>buy[i];
	cin>>m;
	for(register int i=1;i<=m;++i)
	{
		int u,v;
		cin>>u>>v;
		f[u].push_back(v);
	}
	for(register int i=1;i<=n;++i)
		if(dfn[i]==0) dfs(i);
//	for(register int i=1;i<=n;++i)
//		cout<<dfn[i]<<" "<<low[i]<<endl;
	for(register int i=1;i<=cnt1;++i)
	{
		int add=0;
		for(register int j=0;j<a[i].size();++j)
			if(buy[a[i][j]]==use[i]) add++;
		ans*=add,ans%=N; answer+=use[i];
	}
	cout<<answer<<" "<<ans<<endl;
	return 0;
}
/*

*/