#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 100005;
const int M = (int)1e9+7;

int h[N*2], sz;
int cnt[N*2];

struct node
{
    int x, y;
};
node a[N];

long long qpow(int e)
{
    long long res=1, b=2;
    while (e) {
        if (e&1) {
            res = (res*b)%M;
        }
        e >>= 1;
        b = b*b%M;
    }
    return res;
}

void solve()
{
    int n;
    scanf("%d", &n);
    sz = 0;
    for (int i=0; i<n; ++i) {
        scanf("%d%d", &a[i].x, &a[i].y);
        h[sz++] = a[i].x;
        h[sz++] = a[i].y;
    }
    sort(h, h+sz);
    sz = (int)(unique(h, h+sz)-h);
    memset(cnt, 0, sizeof(cnt));
    for (int i=0; i<n; ++i) {
        a[i].x = (int)(lower_bound(h, h+sz, a[i].x)-h);
        a[i].y = (int)(lower_bound(h, h+sz, a[i].y)-h);
        ++cnt[a[i].x];
        --cnt[a[i].y];
    }
    int t=0;
    for (int i=0; i<sz; ++i) {
        t += cnt[i];
        cnt[i] = t;
    }
    long long ans = 0;
    for (int i=0; i<sz; ++i) {
        long long tmp = (qpow(cnt[i])-1) * qpow(n-cnt[i]) % M;
        tmp = tmp * (h[i+1]-h[i]) %M;
        ans = (ans+tmp) % M;
    }
    printf("%I64d\n", ans);
}

int main()
{
    int n;
    scanf("%d", &n);
    for (int i=0; i<n; ++i) {
        solve();
    }
    return 0;
}