#include <bits/stdc++.h>
using namespace std;
bool desc(pair<char, long long>& a, pair<char, long long>& b) {
  if (a.second == b.second) return a.first < b.first;
  return a.second < b.second;
}
int binary(vector<long long> v, long long n, long long x) {
  long long st = 0, en = n;
  while (st <= en) {
    long long mid = st + (en - st) / 2;
    if (v[mid] == x) {
      return mid;
    }
    if (v[mid] < x) {
      st = mid + 1;
    } else if (v[mid] > x) {
      en = mid - 1;
    }
  }
}
int arr[100001];
void sieve() {
  arr[0] = 1;
  arr[1] = 1;
  for (long long i = 2; i < 100001; i++) {
    if (arr[i] == 0) {
      for (long long j = i * 2; j < 100001; j += i) {
        arr[j] = 1;
      }
    }
  }
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
long long hcf(long long a, long long b) {
  if (b == 0) return a;
  return hcf(b, a % b);
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout.tie(0);
  long long test;
  cin >> test;
  while (test--) {
    long long n, l = 0, r = 0, k = 0;
    cin >> n;
    vector<long long> a(n);
    vector<long long> b(n);
    bool x1 = 0;
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
    }
    for (long long i = 0; i < n; i++) {
      cin >> b[i];
    }
    for (long long i = 0; i < n; i++) {
      if ((x1 == 0) && (a[i] != b[i])) {
        l = i;
        x1++;
      }
      if ((x1 == 1) && (a[i] != b[i])) {
        r = i;
      }
    }
    x1 = 0;
    k = abs(a[l] - b[l]);
    for (long long i = l; i <= r; i++) {
      if ((a[i] > b[i]) || (abs(a[i] - b[i]) != k)) {
        x1 = 1;
        break;
      }
    }
    if (x1 == 1) {
      cout << "NO"
           << "\n";
    } else {
      cout << "YES"
           << "\n";
    }
  }
  return 0;
}
