#include <bits/stdc++.h>
using namespace std;
using namespace std;
template <typename T, typename U>
std::istream& operator>>(std::istream& i, pair<T, U>& p) {
  i >> p.first >> p.second;
  return i;
}
template <typename T>
std::istream& operator>>(std::istream& i, vector<T>& t) {
  for (auto& v : t) {
    i >> v;
  }
  return i;
}
template <typename T, typename U>
std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) {
  o << p.first << ' ' << p.second;
  return o;
}
template <typename T>
std::ostream& operator<<(std::ostream& o, const vector<T>& t) {
  if (t.empty()) o << '\n';
  for (size_t i = 0; i < t.size(); ++i) {
    o << t[i] << " \n"[i == t.size() - 1];
  }
  return o;
}
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T, vector<T>, less<T>>;
template <typename T>
bool in(T a, T b, T c) {
  return a <= b && b < c;
}
unsigned int logceil(int x) {
  return (unsigned int)(8 * sizeof(int) - __builtin_clz(x));
}
namespace std {
template <typename T, typename U>
struct hash<pair<T, U>> {
  hash<T> t;
  hash<U> u;
  size_t operator()(const pair<T, U>& p) const {
    return t(p.x) ^ (u(p.y) << 7);
  }
};
}  // namespace std
template <typename T>
T gcd(T a, T b) {
  if (a < b) swap(a, b);
  return b ? gcd(b, a % b) : a;
}
template <typename T>
class vector2 : public vector<vector<T>> {
 public:
  vector2() {}
  vector2(size_t a, size_t b, T t = T())
      : vector<vector<T>>(a, vector<T>(b, t)) {}
};
template <typename T>
class vector3 : public vector<vector2<T>> {
 public:
  vector3() {}
  vector3(size_t a, size_t b, size_t c, T t = T())
      : vector<vector2<T>>(a, vector2<T>(b, c, t)) {}
};
template <typename T>
class vector4 : public vector<vector3<T>> {
 public:
  vector4() {}
  vector4(size_t a, size_t b, size_t c, size_t d, T t = T())
      : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {}
};
template <typename T>
class vector5 : public vector<vector4<T>> {
 public:
  vector5() {}
  vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T())
      : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {}
};
void fastIO() { ios::sync_with_stdio(false); }
template <typename T, typename... Args>
T max(T t, Args... args) {
  return max(max<T>(args...), t);
}
template <typename T, typename... Args>
T min(T t, Args... args) {
  return min(min<T>(args...), t);
}
const int MAXN = 5050;
long long dp[MAXN][MAXN];
void sol(std::istream& in, std::ostream& out) {
  int n;
  in >> n;
  vector<pair<int, int>> v(n);
  in >> v;
  sort(v.begin(), v.end());
  for (int i = 0; i < n + 1; ++i)
    for (int j = 0; j < n + 1; ++j) dp[i][j] = 1e18;
  dp[0][0] = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (j + i >= v[i].first)
        dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);
      else
        dp[i + 1][v[i].first - i] = min(dp[i + 1][v[i].first - i], dp[i][j]);
      if (j != 0) {
        dp[i + 1][j - 1] = min(dp[i + 1][j - 1], dp[i][j] + v[i].second);
      } else {
        dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + v[i].second);
      }
    }
  }
  out << dp[n][0] << endl;
}
class E2GolosovanieUslozhnennayaVersiya {
 public:
  void solve(std::istream& in, std::ostream& out) {
    fastIO();
    int t;
    in >> t;
    for (int i = 0; i < t; ++i) {
      sol(in, out);
    }
  }
};
int main() {
  E2GolosovanieUslozhnennayaVersiya solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
