#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=50010,M=200010;
int n,m,tot;
ll a[N],ans[M],C[N];
int vis[N<<5];
typedef struct node{
int l,r,num;
void read(){
scanf("%d%d",&l,&r);
}
bool operator < (const node& p) const {
return (r < p.r||(r==p.r&&l<p.l));
}
}node;
node q[M];
int lowbit(int x){return x&(-x);}
void update(int x,ll c){
while(x<=n) C[x]+=c,x+=lowbit(x);
}
ll getsum(int x){
ll r=0;
while(x>0) r+=C[x],x-=lowbit(x);
return r;
}
int main(){
//freopen("1.in","r",stdin);
//freopen("1.out","w",stdout);
int i,j,k;
int T,cas=1;
for(scanf("%d",&T);cas<=T;cas++){
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%lld",&a[i]);
scanf("%d",&m);
for(i=1;i<=m;i++) q[i].read(),q[i].num=i;
sort(q+1,q+m+1);
memset(vis,0,sizeof(vis));
memset(C,0,sizeof(C));
memset(ans,0,sizeof(ans));
for(i=k=1;i<=n;i++){
if(vis[a[i]]) update(vis[a[i]],-a[i]);
update(vis[a[i]]=i,a[i]);
while(q[k].r==i){
ans[q[k].num]+=getsum(i)-getsum(q[k].l-1);
k++;
}
}
for(i=1;i<=m;i++) printf("%lld\n",ans[i]);
}
return 0;
}
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
using namespace std;
typedef long long ll;
const int N = 50010, MOD = 1000000007;
struct node
{
int l, r, id;
} g[N*4];
int n, m, unit;
int a[N], num[N*20];
ll tmp, res[N*4];
void add(int i)
{
if(num[i] == 0) tmp += i;
num[i]++;
}
void del(int i)
{
num[i]--;
if(num[i] == 0) tmp -= i;
}
void solve()
{
unit = (int)sqrt(1.0*n);
memset(num, 0, sizeof num);
sort(g+1, g+1+m, [](node a, node b){return a.l/unit != b.l/unit ? a.l/unit < b.l/unit : a.r < b.r;});
int l = 1, r = 0;
tmp = 0;
for(int i = 1; i <= m; i++)
{
while(r < g[i].r) add(a[++r]);
while(r > g[i].r) del(a[r--]);
while(l < g[i].l) del(a[l++]);
while(l > g[i].l) add(a[--l]);
res[g[i].id] = tmp;
}
for(int i = 1; i <= m; i++) printf("%lld\n", res[i]);
}
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
scanf("%d", &m);
for(int i = 1; i <= m; i++) scanf("%d%d", &g[i].l, &g[i].r), g[i].id = i;
solve();
}
return 0;
}