#include <bits/stdc++.h>
using namespace std;
typedef int (*uniopi)(int);
typedef long long (*uniopl)(long long);
typedef int (*binopi)(int, int);
typedef long long (*binopl)(long long, long long);
typedef int (*tupopi)(int, int, int);
typedef long long (*tupopl)(long long, long long, long long);
const long double PI = acos(0) * 2;
const int INF = 0x3f2f1f0f;
const long long LINF = 1ll * INF * INF;
int X4[] = {-1, 0, 1, 0}, Y4[] = {0, -1, 0, 1};
int X8[] = {-1, -1, -1, 0, 1, 1, 1, 0}, Y8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
template <typename T>
inline bool uax(T& a, T b) {
  return a < b ? (a = b, 1) : 0;
}
template <typename T>
inline bool uin(T& a, T b) {
  return a > b ? (a = b, 1) : 0;
}
template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << '(' << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i];
    if (i + 1 < (int)v.size()) os << ' ';
  }
  return os;
}
const int MAX_N = 3e5 + 1;
int N, A[MAX_N], B[MAX_N];
long long D[MAX_N][3];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(nullptr);
  cout << std::setprecision(10);
  cout << fixed;
  int q;
  cin >> q;
  while (q--) {
    cin >> N;
    for (int i = 1; i <= N; i++) cin >> A[i] >> B[i];
    for (int i = N; i >= 0; i--) {
      for (int j = 0; j < 3; j++) {
        long long& d = D[i][j] = LINF;
        int a = A[i] + j, b = B[i], c = j * b, na = A[i + 1];
        if (a != na) uin(d, D[i + 1][0] + c);
        if (a != na + 1) uin(d, D[i + 1][1] + c);
        if (a != na + 2) uin(d, D[i + 1][2] + c);
      }
    }
    cout << D[0][0] << endl;
    for (int i = 1; i <= (N); i++)
      for (int j = 0; j < (3); j++) D[i][j] = 0;
  }
  return 0;
}
