#include<algorithm>//sort
#include<cstring>
#include<iostream>
#include<map>
#include<queue>
#include<stack>
#include<utility>//pair
#include<map>
#include<stack>
#include<vector>
//#define int long long
using namespace std;
void so()
{
	int n,s;
	long long sum = 0;
	stack<int>q;
	map<int, int>ma;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> s;
		ma[s] = 1;
		while (q.size() && q.top()<s)
		{
			ma[s] += ma[q.top()];
			sum += ma[q.top()];
			q.pop();
		}
		q.push(s);
	}
	int a[200005];
	n = q.size();
	while (q.size())
	{
		a[q.size()] = q.top();
		q.pop();
	}
	int ss = 0;
	for (int i = n; i >= 2; i--)
	{
		if (a[i] != a[i - 1])
		{
			sum += a[i];
		}
		ss += a[i];
	}
	cout << sum << endl;
}
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		so();
	}
}