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

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

bool isnum(char c){
  return '0' <= c && c <= '9';
}

bool isCap(char c){
  return 'A' <= c && c <= 'Z';
}
bool isSmall(char c){
  return 'a' <= c && c <= 'z';
}
map<string,int> table;

int calc(string& mole, int beg, int ed){
  if(ed <= beg) return 0;

  if(mole[beg] == '('){
	int cnt = 0, i;
	for(i=beg;i<ed;++i)
	  if(mole[i] == '(') ++cnt;
	  else if(mole[i] == ')')
		if(--cnt == 0){
		  int res1 = calc(mole, beg+1, i);
		  if(res1 < 0) return -1;
		  ++i;
		  res1 *= atoi(mole.substr(i).c_str());
		  for(;i<ed;++i) if(!isnum(mole[i])) break;
		  int res2 = calc(mole, i, ed);
		  if(res2 < 0) return -1;
		  return res1 + res2;
		}
  }
  if(beg+1 == ed || !isSmall(mole[beg+1])){
	string atm = mole.substr(beg, 1);
	if(!table.count(atm)) return -1;
	int res = calc(mole, beg+1, ed);
	if(res < 0) return -1;
	return table[atm] + res;
  }
  else{
	string atm = mole.substr(beg, 2);
	if(!table.count(atm)) return -1;
	int res = calc(mole, beg+2, ed);
	if(res < 0) return -1;
	return table[atm] + res;
  }
}

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  string atom;
  for(;;){
	cin >> atom;
	if(atom == "END_OF_FIRST_PART") break;
	int x; cin >> x;
	table[atom] = x;
  }

  string mole;
  while(cin>>mole, mole != "0"){
	for(int i=1;i<SZ(mole);++i)
	  if(isnum(mole[i]) && mole[i-1] != ')'){
		if(isCap(mole[i-1])){
		  mole.insert(i, ")");
		  mole.insert(i-1, "(");
		}
		else if(isSmall(mole[i-1])){
		  mole.insert(i, ")");
		  mole.insert(i-2, "(");
		}
	  }

	int wei = calc(mole, 0, SZ(mole));
	if(wei < 0) cout << "UNKNOWN" << endl;
	else cout << wei << endl;
  }

  return 0;
}