Segment tree basic

// querying and finding min value;
//1  
//7
//1 2 0 3 4 1 2 
//3
//0 3
//1 4
//4 6

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define ii pair<int,int>
#define endl "\n"
#define mod 1000000007
#define all(v) (v).begin(),(v).end()
#define SQ(a) (a)*(a)
#define MP make_pair
const int inf = 1e9 + 7;

void build(int ind, int low , int high, int arr[], int seg[])
{
  if(low==high)
  {
    seg[ind] = arr[low];
    return;
  }
  int mid = (low+high)/2;
  build(2*ind+1,low,mid,arr,seg);
  build(2*ind+2,mid+1,high,arr,seg);

  seg[ind]= min(seg[2*ind+1],seg[2*ind+2]);

}

int query(int ind,int low,int high, int l,int r,int seg[])
{
  // no overlap
  // l r low high or low high l r
  if(r<low || high< l)
  {
    return INT_MAX;
  }

  //complete overlap
  //l low high r
  if(low>=l && high<=r)
  {
    return seg[ind];
  }
  // partial overlap
  int mid = (low+high)/2;
  int left = query(2*ind+1,low,mid,l,r,seg);
  int right = query(2*ind+2,mid+1,high,l,r,seg);
  return min(left,right);

}



void solve()
{
  int n;
  cin>>n;
  int arr[n];
  for(int i=0;i<n;i++)
  {
    cin>>arr[i];
  }
  int seg[4 * n];
  build(0,0,n-1,arr,seg);
  int q;
  cin>>q;
  while(q--)
  {
    int l, r;
    cin>>l>>r;
    cout<<query(0,0,n-1,l,r,seg)<<endl;
  }
}


int main()
{
  ios::sync_with_stdio(0);
  cin.tie(0);
  ll t;
  cin>>t;
  while(t--)
  {
    solve();
  }
}