# include <cstdio>

# include <cstring>

# include <cstdlib>

# include <iostream>

# include <vector>

# include <queue>

# include <stack>

# include <map>

# include <set>

# include <cmath>

# include <algorithm>

using namespace std;

# define lowbit(x) ((x)&(-x))

# define pi acos(-1.0)

# define eps 1e-

# define MOD

# define INF

# define mem(a,b) memset(a,b,sizeof(a))

# define FOR(i,a,n) for(int i=a; i<=n; ++i)

# define FO(i,a,n) for(int i=a; i<n; ++i)

# define bug puts("H");

# define lch p<<,l,mid

# define rch p<<|,mid+,r

//# define mp make_pair

# define pb push_back

typedef pair<int,int> PII;

typedef vector<int> VI;

# pragma comment(linker, "/STACK:1024000000,1024000000")

typedef long long LL;

int Scan() {

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

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

    return x*f;

}

void Out(int a) {

    if(a<) {putchar('-'); a=-a;}

    if(a>=) Out(a/);

    putchar(a%+'');

}

const int N=;

//Code begin...

struct Node{int t, b;}node[N];

int dp[N][<<][];

int main ()

{

    int T, n;

    scanf("%d",&T);

    while (T--) {

        scanf("%d",&n); FO(i,,N) FO(j,,<<) FO(k,,) dp[i][j][k]=INF;

        FOR(i,,n) scanf("%d%d",&node[i].t,&node[i].b);

        int mi=INF;

        FOR(i,,n) {

            --mi;

            if (mi<) break;

            mi=min(mi,node[i].b);

            dp[][<<(i-)][(i-)+]=;

        }

        FOR(i,,n) FO(j,,<<) FOR(k,,) {

            if (dp[i][j][k]==INF) continue;

            if (j&) dp[i+][j>>][k-]=min(dp[i+][j>>][k-],dp[i][j][k]);

            else {

                mi=INF;

                FOR(l,i,n) {

                    --mi;

                    if (mi<) break;

                    if ((j&(<<(l-i)))==) {

                        dp[i][j|(<<(l-i))][l-i+]=min(dp[i][j|(<<(l-i))][l-i+],dp[i][j][k]+(node[l].t^node[i+k-].t));

                        mi=min(mi,node[l].b);

                    }

                }

            }

        }

        int ans=INF;

        FOR(i,,) ans=min(ans,dp[n+][][i]);

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

    }

    return ;

}