#include<bits/stdc++.h>
using namespace std;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        vector<int> r(n), s(n);
        for (int i=0; i<n; i++) cin >> r[i] >> s[i];
        vector<int> exitPos[n];

        //cout << "Input Done" << endl;

        int scoreL[n][4];
        memset(scoreL, 0, sizeof(scoreL));
        multiset<int, greater<int>> st;
        for (int i=0; i<n; i++) {
            st.insert(s[i]);
            int jL = min(n-1, i + r[i]);
            exitPos[jL].push_back(s[i]);
            vector<int> va;
            auto it = st.begin();
            for (int j=1; j<=3; j++) {
                if (it == st.end()) break;
                scoreL[i][j] = scoreL[i][j-1] + *it;
                it++;
            }
            //cout << i << " " << scoreL[i][1] << " " << scoreL[i][2] << " " << scoreL[i][3] << endl;
            for (int v: exitPos[i]) if (st.find(v) != st.end()) st.erase(st.find(v));
        }

        st.clear();
        int scoreR[n][4];
        vector<int> exitPosR[n];
        memset(scoreR, 0, sizeof(scoreR));
        for (int i=n-2; i>=0; i--) {
            st.insert(s[i + 1]);
            int jL = max(0, i+1 - r[i+1]);
            //cout << s[i+1] << " " << jL << endl;
            exitPosR[jL].push_back(s[i + 1]);
            //cout << st.size() << endl;
            auto it = st.begin();
            for (int j=1; j<=3; j++) {
                if (it == st.end()) break;
                scoreR[i][j] = scoreR[i][j-1] + *it;
                it++;
            }
            //cout << i << " " << scoreR[i][1] << " " << scoreR[i][2] << endl;

            for (int v: exitPosR[i]) if (st.find(v) != st.end()) st.erase(st.find(v));
            
        }

        int ans = 0;
        for (int i=0; i<n; i++) {
            ans = max(ans, scoreL[i][3]);
            ans = max(ans, scoreL[i][2] + scoreR[i][1]);
            ans = max(ans, scoreL[i][1] + scoreR[i][2]);
        }
        cout << ans << endl;

    }

}