#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
//#include <utility>
#include <set>
#include <iostream>
//#include <memory>
#include <string>
#include <vector>
#include <algorithm>
//#include <functional>
#include <sstream>
//#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
//#include <cctype>
#include <cstring>
//#include <ctime>
#include <iterator>
#include <bitset>
//#include <numeric>
//#include <list>
//#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;

void mainmain(){
	int n;
	while(cin>>n,n){
		map<string,int> ma;
		vector<pair<string,int>> v(n);
		rep(i,n) cin>>v[i].F>>v[i].S;
		rep(i,n){
			ma[v[i].F]=v[i].S;
		}
		int m;
		cin>>m;
		vector<pair<string,vector<string>>> vp(m);
		rep(i,m){
			cin>>vp[i].F;
			int t;
			cin>>t;
			vector<string> tmp(t);
			rep(j,t){
				cin>>tmp[j];
			}
			vp[i].S=tmp;
		}
		string s;
		cin>>s;
		bool update=false;
		rep(i,m){
			update=false;
			rep(j,m){
				int tmp=0;
				rep(k,vp[j].S.size()){
					tmp+=ma[vp[j].S[k]];
				}
				if(tmp<ma[vp[j].F]){
					ma[vp[j].F]=tmp;
					update=true;
				}
			}
			if(!update) break;
		}
		cout<<ma[s]<<endl;
	}
}



}
main() try{
    mainmain();
}
catch(...){
}