#include <cstdio>#include <queue>#include <cstring>#include <iostream>#include <cstdlib>#include <algorithm>#include <vector>#include <map>#include <string>#include <set>#include <ctime>#include <cmath>#include <cctype>usingnamespacestd;
#define maxn 100000#define LL long longint cas=1,T;
int p[1000005];
int s[1000005];
int h[1000005];
int main()
{
scanf("%d",&T);
while (T--)
{
int n;
scanf("%d",&n);
for (int i = 0;i<n;i++)
scanf("%d",&p[i]);
for (int i = 0;i<n;i++)
scanf("%d",&s[i]);
int level = s[0];
for (int i = 0;i<n;i++)
{
if (level>s[i])
level = s[i];
if (level < p[i])
level = p[i];
h[i]=level;
}
level = s[n-1];
int ans =0;
for (int i = n-1;i>=0;i--)
{
if (level >s[i])
level = s[i];
if (level < p[i])
level = p[i];
ans+=min(level,h[i])-p[i];
}
printf("%d\n",ans);
}
return0;
}