#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
long  n;
long t;
vector<string> g;
vector<long> health;
vector<long> first;
vector<long> last;
vector<string> dna;

long search(string a,long first,long last)
    {long sum=0;
    for(long i=first;i<=last;i++)
        {if(a.compare(g[i])==0)
            sum+=health[i];}
     return sum;
}

long doit(string a,long first,long last)
    {long sum=0;
     string r;
   
    for(long i=0;i<a.length();i++)
        {   r=a[i];
         if(i==a.length()-1) sum+=search(r,first,last);
         else
         for(long j=i+1;j<a.length();j++)
                {//cout<<r<<sum<<endl;
                 sum+=search(r,first,last);
                r.push_back(a[j]);}
    }

return sum;}

int main() {
   
    cin>>n;
    g.resize(n);
    health.resize(n);
    for(long i=0;i<n;i++)
        cin>>g[i];
    
    for(long i=0;i<n;i++)
        cin>>health[i];
    cin>>t;
    long max=-1, min=999999999,k;
    first.resize(t);
    last.resize(t);
    dna.resize(t);
    for(long i=0;i<t;i++)
    {cin>>first[i]>>last[i];
     cin>>dna[i];
       k= doit(dna[i],first[i],last[i]);
     if(k>max) max=k;
     if(k<min) min=k;
    // cout<<k<<endl;
    }
    cout<<min<<" "<<max;
    return 0;
}