#include <bits/stdc++.h>
#include <cassert>

using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define vvi vector<vi>
#define vll vector<long long>
#define fi first
#define se second
void test_case() {
    int n;
    cin >> n;
    vvi add(n), del(n);
    for(int i = 0; i < n; i++) {
        int r, s;
        cin >> r >> s;
        int left = max(0,i-r);
        int right = min(n-1,i+r);
        add[left].pb(s);
        del[right].pb(s);
    }
    int ans = 0;
    multiset<int> st;
    for(int i = 0; i < n; i++) {
        for(auto x : add[i]) st.insert(x);
        if(st.size() < 3) continue;
        vi v;
        int cur = 0;
        while(v.size() < 3) {
            auto it = st.end();
            it--;
            v.pb(*it);
            cur += *it;
            st.erase(it);
        }
        ans = max(ans, cur);
        for(auto x : v) st.insert(x);
        for(auto x : del[i]) {
            auto it = st.find(x);
            if(it != st.end()) {
                st.erase(it);
            }
        }
    }
    cout << ans << "\n";
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int tc = 1;
    cin >> tc;
    while(tc--) {
        test_case();
    }
    return 0;
}