#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(0); cin.tie(0);
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()

const int INF = 1e9;
const ll LLINF = 1e18;
const int N = 1030;

int a[N][N], fen[N][N];
int n;

void fenUpdate(int x, int y, int k){
    for (int i=x; i<=n; i+=i&-i)
        for (int j=y; j<=n; j+=j&-j)
            fen[i][j]+=k;
}

int fenGet(int x, int y){
    int ans = 0;
    for (int i=x; i>0; i-=i&-i)
        for (int j=y; j>0; j-=j&-j)
            ans+=fen[i][j];
    return ans;
}

int fenSum(int x1, int y1, int x2, int y2){
    return fenGet(x2, y2)
            - fenGet(x1-1, y2)
            - fenGet(x2, y1-1)
            + fenGet(x1-1, y1-1);
}

int main(){
    fastIO;

    int t;
    cin >> t;
    while (t--){
        cin >> n;
        string s;
        while (cin >> s){
            if (s=="SET"){
                int x, y, k;
                cin >> x >> y >> k;
                x++;
                y++;
                fenUpdate(x, y, -a[x][y]);
                a[x][y] = k;
                fenUpdate(x, y, a[x][y]);
            }
            else if (s=="SUM"){
                int x1, x2, y1, y2;
                cin >> x1 >> y1 >> x2 >> y2;
                cout << fenSum(++x1, ++y1, ++x2, ++y2) << '\n';
            }
            else break;
        }
        cout << '\n';
        for (int i=1; i<=n; i++) for (int j=1; j<=n; j++){
            fen[i][j] = 0;
            a[i][j] = 0;
        }
    }
    return 0;
}