#include<bits/stdc++.h>

#define rep(i,x,y) for(register int i=x;i<=y;i++)

using namespace std;

inline int read(){

    int x=,f=;char ch=getchar();

    while(!isdigit(ch)){if(ch=='-')f=-;ch=getchar();}

    while(isdigit(ch)){x=(x<<)+(x<<)+(ch^);ch=getchar();}

    return x*f;}

const int N=;

const int inf=0x3f3f3f3f;

int n,t[N],b[N],dp[N][<<][];

#define f(i,j,k) dp[i][j][k+8]

inline void sudo(){ n=read();

    rep(i,,n) t[i]=read(),b[i]=read();

    memset(dp,inf,sizeof dp);

    f(,,-)=;

    rep(i,,n)rep(j,,(<<)-)

    rep(k,-,)if(f(i,j,k)!=inf)

        if(j&) f(i+,j>>,k-)=min(f(i+,j>>,k-),f(i,j,k));

        else{

            int r=inf;

            rep(h,,)if(!((j>>h)&)){//在这个人之前的未打饭的人

                if(i+h>r) break;

                r=min(r,i+h+b[i+h]);

                //距离i的最远距离

                //判断i+k就是判断上一次是否是起点

                f(i,j|(<<h),h)=min(f(i,j|(<<h),h),f(i,j,k)+(i+k?(t[i+k]^t[i+h]):));

            }

        }

    int ans=inf; rep(k,-,-)

    ans=min(ans,f(n+,,k));

    printf("%d\n",ans);return;}

int main(){

    int T=read();while(T--) sudo();return ;}