#include <iostream>
#include <vector>
#include <cassert>
#include <queue>
#include <set>
#include <stack>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <cmath>

using namespace std;
struct cmp
{
  bool operator()(const pair<int, bool> &A, const pair<int, bool> &B)
  {
    return A.first < B.first;
  }
};
typedef set <pair <int, bool>, cmp > X;

#define EACH(x) for(X::iterator it=x.begin(); it!=x.end(); ++it)

void solve();

int main()
{
  int T;
  scanf("%d", &T);
  while(T--)
    solve();
}

void solve()
{
  char D[4][10] = {"push", "add", "subtract", "negate"};
  stack <X> A;
  int N;
  int pushed = 0;
  int summed = 0;
  scanf("%d", &N);
  for(int i=0; i<N; i++)
  {
    char temp[10];
    scanf("%10s", temp);
    assert(pushed - summed == A.size());
    if(!strcmp(temp, D[0]))
    {
      X temp;
      temp.insert(make_pair(pushed, true));
      A.push(temp);
      pushed++;
    }
    else if(!strcmp(temp, D[1])) 
    {
      summed++;
      assert(A.size() >= 2);
      X x = A.top();
      A.pop();
      X y = A.top();
      A.pop();
      X z;
//      set_union(x.begin(), x.end(), y.begin(), y.end(), inserter(z, z.begin()));
      EACH(x) z.insert(make_pair((*it).first, (*it).second));
      EACH(y) z.insert(make_pair((*it).first, (*it).second));
      A.push(z);
    }
    else if(!strcmp(temp, D[2]))
    {
      summed++;
      assert(A.size() >= 2);
      X x = A.top();
      A.pop();
      X y = A.top();
      A.pop();
      X z;
      EACH(x) z.insert(make_pair((*it).first, (*it).second));
      EACH(y) z.insert(make_pair((*it).first, !(*it).second));
      A.push(z);
    }
    else if(!strcmp(temp, D[3]))
    {
      X x = A.top();
      A.pop();
      X z; 
      EACH(x) z.insert(make_pair((*it).first, !(*it).second));
      A.push(z);
    }
    else
      assert(false);
  }
  assert(pushed - summed == A.size());
  assert(A.size() == 1);

  vector <long> B;
  for(int i=0; i<pushed; i++)
  {
    long temp;
    scanf("%ld", &temp);
    B.push_back(temp);
  }
  sort(B.begin(), B.end());
  int b_index = 0;
  long ans[pushed];
  long sum = 0;
  EACH(A.top())
    if(!(*it).second)
    {
      assert((*it).first < pushed);
      ans[(*it).first] = B[b_index];
      sum -= B[b_index];
      b_index++;
    }
  EACH(A.top())
    if((*it).second)
    {
      assert((*it).first < pushed);
      ans[(*it).first] = B[b_index];
      sum += B[b_index];
      b_index++;
    }
  assert(b_index == pushed);
  cout << sum << endl;
  for(int i=0; i<pushed; i++)
    cout << ans[i] << " ";
  cout << endl;

}