#include <bits/stdc++.h>
using namespace std;

const int N = 5e4 + 200;

int n, p[N], pos[N];

struct dsu {
    int p[N], r[N];
    void init(int m) {
        for (int i = 1; i <= m; ++i) {
            p[i] = i;
            r[i] = 0;
        }
    }
    int get(int v) {
        return p[v] = (p[v] == v ? v : get(p[v]));
    }
    bool unite(int v, int u) {
        if ((v = get(v)) == (u = get(u))) return false;
        if (r[v] < r[u]) swap(v, u);
        r[v]++;
        p[u] = v;
        return true;
    }
} ds;

void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> p[i];
        pos[p[i]] = i;
    }
    vector<pair<int, pair<int, int>>> e;
    for (int i = 2; i <= n; ++i) {
        e.push_back({abs(p[i] - p[i - 1]), {i, i - 1}});
    }
    for (int i = 2; i <= n; ++i) {
        e.push_back({abs(pos[i] - pos[i - 1]), {pos[i], pos[i - 1]}});
    }
    ds.init(n);
    sort(e.begin(), e.end());
    long long ans = 0;
    for (auto [w, l] : e) {
        if (ds.unite(l.first, l.second)) {
            ans += w;
        }
    }
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
}