#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n;
    cin>>n;
    string s[n]; int h[n]; int q;  int si=0;
    int f,l,j,k,z; string g;  int len=1;
    long int min=99999,max=0,heal=0;
    string m;
    for(int i=0;i<n;i++)
        {
           cin>>s[i];
           if(s[i].length()>si)
               si=s[i].length();
        }
    
    for(int i=0;i<n;i++)
        {
           cin>>h[i];
        }
    
       cin>>q;
    for(int i=0;i<q;i++)
        {
              cin>>f>>l;
              cin>>g;
              heal=0;  //cout<<"gene "<<g;
                 for(j=0;j<g.length();j++)
                     {
                        while(len<=si && ((j+len)<=g.length()))
                            {
                                m=g.substr(j,len);  //cout<<"\tsubstr "<<m;
                                for(z=f;z<=l;z++)
                                    {
                                        if(m.compare(s[z])==0)
                                            {
                                                heal=heal+h[z];   //cout<<" added "<<h[z];
                                                
                                            
                                            }
                                    
                                    }   ++len;
                            
                            
                            }
                        len=1; 
                     
                     }   //cout<<heal;
        
             
               if(heal<min)
                   min=heal;
               if(heal>max)
                   max=heal;
              
        }
    
     cout<<min<<" "<<max;
    //cout<<"length"<<si;
    return 0;
}