#include<bits/stdc++.h>
using namespace std;

typedef long long lld;

int lllhj()
{

    lld n;

    cin >> n;

    lld a[n];

    for(lld i = 0;i < n;i++)
        cin >> a[i];

    sort(a,a+n);
    lld j = 0,ans = 0;
    for(lld i = n -1;i >= 0;i--)
    {

        ans += a[i]*(lld)pow(2,j);
        j++;

    }

    cout << ans;
    return 0;
}

lld pre[100005];
//---constructing prefix-suffix matching array pre[]
template< class T>
void prefix(T pat[],lld m)
{  lld j=0;
   pre[0]=0;
   
   lld i=1;
   while(i<m)    //---i=1 to m-1
   {
        if(pat[i]==pat[j])   //--increment i and j both
         {
             j++;
             pre[i]=j;
             i++;
          }

        else                  //----if not equal increment check if j=0 or not 
         {
           if(j)            //--when 0 then move to pre[j-1] and don't increment i untill j=0
            j=pre[j-1];
           
           else           //----if j=0 then increment i
            { pre[i]=0;
              i++;
            }

         }

    }

}

template<class T>
int kmp(T src[],lld n,T pat[],lld m)
{

  prefix(pat,m);
  lld i=0,j=0,ans=0;

  while(i<n)
  {
      if(pat[j]==src[i])
      {
      	i++;
      	j++;
      	//cout<<src[i]<<" ";
      }

      if(j==m)    //----pattern matches source
      {  ans++;   //----for number of found patterns
      	 j=pre[j-1];
      }	 

      else if(pat[j]!=src[i]&&i<n)
      {
            if(j)
            j=pre[j-1];
            
            else
             i++;	
       }	


    }

  return ans;
}




int main()
{
	lld n;
	cin >> n;

	vector<pair<string, lld> > v(n);

	for (lld i = 0;i < n;i++)
	{
		cin >> v[i].first;
	}

	for (lld i = 0;i < n;i++)
	{
		cin >> v[i].second;
	}



	/*for (lld i = 0;i < n;i++)
	{
		cout<< v[i].first << " " << v[i].second << "\n";
	}*/
	lld q;
	cin >> q;

	lld mx = LLONG_MIN;
	lld mn = LLONG_MAX;

	while (q--)
	{
		lld l, r;
		string s;
		cin >> l >> r >> s;

		lld ans1 = 0;
		lld ans2 = 0;

		for (lld i = l;i <= r;i++)
		{
			string res = v[i].first;
			string concat = res + "$" + s;
		
			get_Z_arr(concat);
			lld r=search_z(concat, res);

			lld val = r*v[i].second;

			//cout << val<<"\n";
			ans1 = ans1 + val;

		}

		mx = max(mx, ans1);
		mn = min(mn, ans1);

	}

	cout << mn << " " << mx;
}