#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
template <class T>
void _db(const char* dbStr, T e) {
  cout << dbStr << " = " << e << endl;
}
template <class T, class... L>
void _db(const char* dbStr, T e, L... r) {
  while (*dbStr != ',') cout << *dbStr++;
  cout << " = " << e << ',';
  _db(dbStr + 1, r...);
}
template <class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
  o << "[";
  int i = 0;
  for (const pair<S, T>& pr : v)
    o << (!i++ ? "" : ", ") << "{" << pr.first << " : " << pr.second << "}";
  return o << "]";
}
template <template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
  o << "[";
  int i = 0;
  for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
  return o << "]";
}
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
  return o << "(" << pr.first << ", " << pr.second << ")";
}
ostream& operator<<(ostream& o, const string& s) {
  for (const char& c : s) o << c;
  return o;
}
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;
int N, M, K, Q;
V<bool> on;
struct FenwickTree {
  vector<ll> bit;
  int n, LOGN;
  void init(int _n) {
    n = _n;
    LOGN = log2(n) + 1;
    bit.assign(n + 1, 0);
  }
  FenwickTree(int _n) { init(_n); }
  FenwickTree() {}

 private:
  ll sum(int idx) {
    ll ret = 0;
    for (; idx > 0; idx -= idx & -idx) ret += bit[idx];
    return ret;
  }

 public:
  ll sum(int l, int r) { return sum(r) - sum(l - 1); }
  void add(int idx, ll delta) {
    for (; idx <= n; idx += idx & -idx) bit[idx] += delta;
  }
};
int I;
V<ll> queries;
V<pair<pair<short, short>, int>> bulbs[2001];
FenwickTree ft[2001];
V<pair<pair<short, short>, pair<short, bool>>> toAnswer[2001];
struct Garland {
  void go() {
    ft[I] = FenwickTree(M);
    bulbs[I].push_back(make_pair(make_pair(N + 1, 1), 0));
    sort(bulbs[I].begin(), bulbs[I].end());
    sort(toAnswer[I].begin(), toAnswer[I].end());
    int ptr = 0;
    for (auto& bulb : bulbs[I]) {
      while (ptr < int(toAnswer[I].size()) &&
             toAnswer[I][ptr].first < bulb.first) {
        queries[toAnswer[I][ptr].second.first] +=
            (toAnswer[I][ptr].second.second * 2 - 1) *
            ft[I].sum(1, toAnswer[I][ptr].first.second);
        ++ptr;
      }
      ft[I].add(bulb.first.second, bulb.second);
    }
    ft[I].bit.clear();
    bulbs[I].clear();
    toAnswer[I].clear();
  }
};
Garland garlands[2001];
int main() {
  ios::sync_with_stdio(false);
  cout.precision(10);
  cin.tie(0);
  cin >> N >> M >> K;
  on.assign(K, 1);
  for (int i = 0; i < K; ++i) {
    int len;
    cin >> len;
    for (int j = 0; j < len; ++j) {
      int x, y, w;
      cin >> x >> y >> w;
      bulbs[i].push_back(make_pair(make_pair(x, y), w));
    }
  }
  cin >> Q;
  for (int i = 0; i < Q; ++i) {
    string s;
    cin >> s;
    if (s == "SWITCH") {
      int idx;
      cin >> idx;
      --idx;
      on[idx] = !on[idx];
    } else {
      int x, y, xx, yy;
      cin >> x >> y >> xx >> yy;
      for (int j = 0; j < K; ++j) {
        if (on[j]) {
          toAnswer[j].push_back(
              make_pair(make_pair(xx, yy), make_pair(int(queries.size()), 1)));
          if (x > 1)
            toAnswer[j].push_back(make_pair(make_pair(x - 1, yy),
                                            make_pair(int(queries.size()), 0)));
          if (y > 1)
            toAnswer[j].push_back(make_pair(make_pair(xx, y - 1),
                                            make_pair(int(queries.size()), 0)));
          if (x > 1 && y > 1)
            toAnswer[j].push_back(make_pair(make_pair(x - 1, y - 1),
                                            make_pair(int(queries.size()), 1)));
        }
      }
      queries.push_back(0);
    }
  }
  for (int i = 0; i < K; ++i) {
    I = i;
    garlands[i].go();
  }
  for (int i = 0; i < int(queries.size()); ++i) {
    cout << queries[i] << '\n';
  }
  return 0;
}
