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

long long Solve(long long N, long long M, long long P, vector<long long> S, vector<long long> A, vector<long long> B) {
	for (int i = 0; i < P; i++) A[i] -= 1;
	for (int i = 0; i < N; i++) S[i] -= 1;

	// Step 1. Sorting
	vector<long long> List;
	for (int i = 0; i < P; i++) List.push_back((S[A[i]] - B[i] + 2000000000LL * M) % M);
	sort(List.begin(), List.end());

	// Step 2. Get Initial Answer
	long long Sum = 0;
	for (int i = 0; i < (int)List.size(); i++) Sum += List[i];

	// Step 3. Solve
	long long Answer = Sum;
	for (int i = 0; i < (int)List.size(); i++) {
		Sum += (i == 0 ? 0 : M);
		Sum -= P * (List[i] - (i == 0 ? 0 : List[i - 1]));
		Answer = min(Answer, Sum);
	}
	return Answer;
}

int main() {
	int T; scanf("%d", &T);
	for (int t = 1; t <= T; t++) {
		long long N, M, P; scanf("%lld%lld%lld", &N, &M, &P);
		vector<long long> S(N, 0);
		vector<long long> A(P, 0);
		vector<long long> B(P, 0);
		for (int i = 0; i < N; i++) scanf("%lld", &S[i]);
		for (int i = 0; i < P; i++) scanf("%lld%lld", &A[i], &B[i]);

		// Output
		printf("%lld\n", Solve(N, M, P, S, A, B));
	}
	return 0;
}