#include <cctype>

#include <algorithm>

#include <vector>

#include <string>

#include <iostream>

#include <sstream>

#include <map>

using namespace std;

#define PB push_back

#define MP make_pair

typedef vector<pair<string,int> > VP;

vector<string> mixture;

VP backpack;

map<string, VP>recipe;

map<string,int> value,state,type,cost;

int gold;

inline void init(void)

{

    gold=;

    backpack.clear();

    recipe.clear();

    mixture.clear();

    value.clear();

    state.clear();

    type.clear();

    cost.clear();

}

inline VP get_recipe(void)

{

    int cnt;

    string line,item;

    stringstream ss;

    ss.clear();

    getline(cin,line);

    ss<<line;

    VP res;

    while(ss>>item)

    {

        if(!islower(item[])) continue;

        ss>>cnt;

        res.PB(MP(item,cnt));

    }

    return res;

}

int get_value(string s)

{

    int res=;

    VP tmp = recipe[s];

    for(size_t i=; i<tmp.size(); i++)

    {

        if(value.find(tmp[i].first)==value.end())

            res+=get_value(tmp[i].first)*tmp[i].second;

        else res+=value[tmp[i].first]*tmp[i].second;

    }

    return res;

}

inline void read(int n,int t)

{

    string item;

    for(int i=,price; i<n; i++)

    {

        cin>>item>>price;

        value[item]=price;

        type[item]=t;

    }

}

inline void read_and_cal(int n)

{

    string item;

    for(int i=,price; i<n; i++)

    {

        cin>>item>>price;

        cost[item]=price;

        recipe[item]=get_recipe();

        mixture.PB(item);

        type[item]=;

    }

    for(int i=; i<n; i++)

    {

        item=mixture[i];

        value[item]=cost[item]+get_value(item);

    }

}

inline int get_num(string s)

{

    int res=;

    for(size_t i=; i<s.size(); i++) res=res*+(s[i]&);

    return res;

}

inline void update(void)

{

    backpack.clear();

    for(map<string,int>::iterator it=state.begin(); it!=state.end(); it++)

    {

        if(type[it->first]==) backpack.PB(MP(it->first,it->second));

        else

        {

            for(int i=; i<(it->second); i++)

                backpack.PB(MP(it->first,));

        }

    }

}

inline void get_item(string s)

{

    if(type[s]==)

    {

        if(cost[s]>gold) return;

        VP tmp=recipe[s];

        for(VP::iterator it=tmp.begin(); it!=tmp.end(); it++)

            if(state[(*it).first]<(*it).second) return;

        for(VP::iterator it=tmp.begin(); it!=tmp.end(); it++)

        {

            state[(*it).first]-=(*it).second;

            if(!state[(*it).first]) state.erase((*it).first);

        }

        gold-=cost[s];

    }

    else

    {

        if(value[s]>gold || backpack.size()==) return;

        gold-=value[s];

    }

    state[s]++;

    update();

}

inline void sell_item(string s)

{

    if(state.find(s)==state.end()) return;

    if(type[s]==)

    {

        gold+=value[s]*state[s];

        state.erase(state.find(s));

    }

    else

    {

        gold+=value[s];

        if(state[s]==) state.erase(state.find(s));

        else state[s]--;

    }

    update();

}

inline void output(int c)

{

    cout<<"Case "<<c<<":\n"<<gold<<'\n'<<backpack.size()<<'\n';

    sort(backpack.begin(),backpack.end());

    for(VP::iterator it=backpack.begin(); it!=backpack.end(); it++)

        cout<<(*it).first<<": "<<(*it).second<<'\n';

    cout<<'\n';

}

int main(void)

{

    int n1,n2,n3,m;

    string opt,arg;

    for(int cas=; cin>>n1; cas++)

    {

        init();

        read(n1,);

        cin>>n2;

        read_and_cal(n2);

        cin>>n3;

        read(n3,);

        for(cin>>m; m--;)

        {

            cin>>opt;

            arg=opt.substr(,opt.size()-);

            if(isdigit(opt[])) gold+=get_num(arg);

            else if(opt[]=='+') get_item(arg);

            else sell_item(arg);

        }

        output(cas);

    }

    return ;

}