#include <bits/stdc++.h>
using namespace std;
const int Max = 1e6;
pair<long long, pair<long long, long long> > a[Max];
vector<long long> idx_odd;
vector<long long> idx_even;
long long n, t;
bool cmp(const pair<long long, pair<long long, long long> > &p1,
         const pair<long long, pair<long long, long long> > &p2) {
  if (p1.first == p2.first) return p2.second.first < p1.second.first;
  return p1.first < p2.first;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> t;
  while (t--) {
    cin >> n;
    for (long long i = 1; i < 2 * n; i++) {
      cin >> a[i].second.first >> a[i].first;
      a[i].second.second = i;
    }
    sort(a + 1, a + (2 * n), cmp);
    long long app = 0;
    for (long long i = 1; i < 2 * n; i++) app += a[i].second.first;
    long long h_app = (app + 1) / 2;
    long long odd_app = 0, even_app = 0;
    idx_even.clear();
    idx_odd.clear();
    for (long long i = 1; i < 2 * n; i += 2) {
      odd_app += a[i].second.first;
      idx_odd.push_back(a[i].second.second);
    }
    for (long long i = 2; i < 2 * n; i += 2) {
      even_app += a[i].second.first;
      idx_even.push_back(a[i].second.second);
    }
    even_app += a[2 * n - 1].second.first;
    idx_even.push_back(a[2 * n - 1].second.second);
    if (odd_app >= h_app) {
      cout << "YES" << endl;
      for (long long i = 0; i < idx_odd.size(); i++) cout << idx_odd[i] << ' ';
      cout << endl;
    } else {
      cout << "YES" << endl;
      for (long long i = 0; i < idx_even.size(); i++)
        cout << idx_even[i] << ' ';
      cout << endl;
    }
  }
  return 0;
}
