1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 using namespace std;
 5 #define N 1000005
 6 #define M 50005
 7 #define numq 200005
 8 #define ll long long
 9 int Last[N];
10 ll shusz[M];
11 int gaga[M];
12 ll ans[numq];
13 struct Q {
14     int l ;
15     int r;
16     int id;
17     bool operator < (const Q a) const
18     {
19         return r<a.r;
20     }
21 }qq[numq];
22 int lb(int i)
23 {
24     return i&(-i);
25 }
26 void add(int j , int t)
27 {
28     for(int i =j ;i < M ;i+=lb(i))
29     {
30         shusz[i]+=t;
31     }
32 }
33 ll sum (int x)
34 {
35     ll ans = 0 ;
36     for(int i = x ; i > 0 ; i-=lb(i))
37     {
38         ans+=shusz[i];
39     }
40     return ans;
41 }
42 ll sum(int x , int y)
43 {
44     ll ans = sum(y)-sum(x-1);//注意是x-1
45     return ans;
46 }
47 int main()
48 {
49     int T ;
50     scanf("%d",&T);
51     for(int i =0 ;i < T ; i++)
52     {
53         int n;
54         scanf("%d",&n);
55         int tm;
56         for(int j = 1 ; j <= n ; j++)
57         {
58             scanf("%d",&tm);
59             gaga[j] = tm;
60         }
61         int m ;
62         scanf("%d",&m);
63         for(int j = 1 ;j <= m ;j++)
64         {
65             int l , r ;
66             scanf("%d%d",&l,&r);
67             qq[j].l = l ;
68             qq[j].r = r;
69             qq[j].id = j;
70         }
71         memset(Last,-1,sizeof(Last));
72         memset(ans,0,sizeof(ans));
73         memset(shusz,0,sizeof(shusz));
74         sort(qq+1,qq+m+1);
75         int cur = 1;//记录扫描到第几个询问
76         for(int j = 1 ; j <= n ; j++)//扫描n个点
77         {
78             if(Last[gaga[j]] != -1)
79                 add(Last[gaga[j]], -gaga[j]);
80             Last[gaga[j]] = j;
81             add(j, gaga[j]);
82             while(j == qq[cur].r)
83             {
84                 ans[qq[cur].id] = sum(qq[cur].l, qq[cur].r);
85                 cur++;
86             }
87         }
88         for(int j = 1; j <= m; j++)
89             printf("%lld\n", ans[j]);
90     }
91     return 0 ;
92 }