//WA on #15#16
#include<bits/stdc++.h>
using  namespace std;
typedef long long ll;

ll n;
ll t[2010], b[2010];

int main()
{
    //freopen("mo.in", "r", stdin);
   // freopen("mo.out", "w", stdout);
    int T;
    cin >> T;
    while(T--)
    {
        cin >> n;
        for(int i = 1;i <= n;i++)
            cin >> t[i];
        for(int i = 1;i <= n;i++)
            cin >> b[i];
        bool flag = false;
        for(int  i = 1;i <= n - i + 1;i++)
        {
            ll sum = t[i] + t[n - i + 1];
            if(b[i] % sum == 0 && b[n - i + 1] % sum == 0)
                continue;
            bool f = false;
            for(int j = 0;j * sum <= b[i] && j * sum <= b[n - i + 1];j++)
            {
                if((b[i] - j * sum) % t[i] == 0 && (b[n - i + 1] - j * sum) % t[n - i + 1] == 0)
                {
                    if((b[i] - j * sum) / t[i] == (b[n - i + 1] - j * sum) / t[n - i + 1])
                    {
                        f = true;
                        break;
                    }
                }
            }
            if(!f)
            {
                flag = true;
                break;
            }
        }

        if(flag)
        cout << "No" << endl;
        else 
        cout << "Yes" << endl;
    }

    return 0;
}