1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
#include<bits/stdc++.h>
using namespace std;
 
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define ST first
#define ND second
 
ostream& operator<<(ostream &out, string str) {
	for(char c : str) out << c;
	return out;
}
 
template<class L, class R> ostream& operator<<(ostream &out, pair<L, R> p) {
	return out << "(" << p.ST << ", " << p.ND << ")";
}

template<class T> auto operator<<(ostream &out, T &&x) -> decltype(x.begin(), out) {
	out << '{';
	for(auto &e : x)
        	out << e << (&e == &*--x.end() ? "" : ", ");
	return out << '}';
}

template<class... Args> void dump(Args&&... args) {
	((cerr << args << ";  "), ...);
}
 
#ifdef DEBUG
#  define debug(x...) cerr << "[" #x "]: ", dump(x), cerr << "\n"
#else
#  define debug(...) false
#endif
 
template<class T> int size(T && a) { return (int) a.size(); }
 
using LL = long long;
using PII = pair<int, int>;

vector<vector<pair<char, int>>> ops;
vector<int> proc;
vector<LL> cur;
LL mem, ans;

void backtrack() {
	int n = size(ops);
	bool leaf = true;
	REP(i, n) {
		if(proc[i] != size(ops[i])) {
			leaf = false;
			LL prev_cur = cur[i];
			LL prev_mem = mem;

			if(ops[i][proc[i]].ST == 'W')
				cur[i] = mem;
			else if(ops[i][proc[i]].ST == 'Z')
				mem = cur[i];
			else if(ops[i][proc[i]].ST == '+')
				cur[i] += ops[i][proc[i]].ND;
			else if(ops[i][proc[i]].ST == '-')
				cur[i] -= ops[i][proc[i]].ND;
			proc[i]++;

			backtrack();
			proc[i]--;
			cur[i] = prev_cur;
			mem = prev_mem;
		}
	}

	if(leaf) ans = min(ans, mem);
}

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

	int t;
	cin >> t;
	REP(_t, t) {
		int n;
		cin >> n;
		ops.clear();
		ops.resize(n);
		REP(i, n) {
			int l;
			cin >> l;
			REP(j, l) {
				char z;
				cin >> z;
				int x = 0;
				if(z == '+' || z == '-')
					cin >> x;
				ops[i].emplace_back(z, x);
			}
		}
		mem = 0, ans = 1e18;
		proc = vector<int>(n);
		cur = vector<LL>(n);
		backtrack();
		cout << ans << "\n";
	}
}