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


int main() {
    long int n,s;
    cin>>n;
    //string gene[n];
    char gene[n][2000006];
    long int val[n];
    for(long int i=0;i<n;i++){
        cin>>gene[i];
    }
    for(long int i=0;i<n;i++){
        cin>>val[i];
    }
    cin>>s;
    long long int min = 2000007,max = -1;
    for(long int i=0;i<s;i++){
        long int first, last;
        char str[2000006];
        cin>>first>>last;
        cin>>str;
        long long int sumsum = 0;
        long int slen = strlen(str);
        long int in = 0;
        //cout<<slen<<endl;
        //cout<<str;
        for(long int j=0;j<slen;j++){
            char s[2000006];
            in=0;
            for(long int k=j;k<slen;k++){
                s[in] = str[k];
                s[in+1] = '\0';
                //cout<<s<<" "<<in<<endl;
                in++;
                for(long int l = first;l<=last;l++){
                    long int lenl = strlen(gene[l]);
                    //cout<<lenl<<" "<<in-1<<endl;
                    if(strcmp(s,gene[l]) == 0 && lenl == in){
                        //cout<<"hi";
                        sumsum += val[l];
                    }
                }
            }
        }
        if(min > sumsum){
            min = sumsum;
        }
        if(max < sumsum){
            max = sumsum;
        }
    }
    cout<<min<<" "<<max<<endl;
    return 0;
}