#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;

struct node
{
    int dif_val;
    int id;
    bool operator < (const node &a)const
    {
        return dif_val > a.dif_val;
    }
}b[100005];

int main()
{
    int T,n,a[100005],i,j;
    long long sum,t;
    scanf("%d",&T);
    while(T--)
    {
        memset(b,0,sizeof(b));
        scanf("%d",&n);
        scanf("%d",&a[0]);
        for(i=1;i<n;i++)
        {
            scanf("%d",&a[i]);
            b[i].dif_val=abs(a[i]-a[i-1]);
            b[i].id=i;
        }
        sort(b+1,b+n);
        for(i=0,sum=0;i<n;i++)
        {
            if(i != 0 && i != n - 1)
            {
                t = abs(a[i + 1] - a[i - 1]);
                j = 1;
                while(b[j].id == i || b[j].id == i + 1)     
                    j++;
                if(b[j].dif_val > t)
                    sum += b[j].dif_val;
                else
                    sum += t;
            }
            else if(i == 0)
            {
                j = 1;
                if(b[j].id == 1)
                    j++;
                sum += b[j].dif_val;
            }
            else if(i == n - 1)
            {
                j = 1;
                if(b[j].id == n - 1)
                    j++;
                sum += b[j].dif_val;
            }
        }
        printf("%I64d\n",sum);
    }
    return 0;
}