Network Coverage

### 题目描述 给你$n$个城市，这$n$个城市首尾相接形成一个环，已知每个城市有一定数量的家庭需要网络。同时每一座城市中有一个网络基站，每一个网络基站可以为一定数量的家庭提供网络，并且第$i$个网络基站只能给第$i$个城市和第$i+1$个城市的家庭提供网络（第$n$个网络基站可以给第$n$座城市和第$1$座城市提供网络）。 现在给你每一座城市需要网络的家庭数量$a_i$和每一个网络基站可以提供的最多网络数量$b_i$，请你判断能否使得所有的家庭都获得网络，可以则输出“YES“，否则输出”NO“。 ### 输入格式 第一行包含一个正整数$t( 1 \le t \le 10^4)$表示数据的组数。 每个测试数据的第一行包含一个正整数$n( 2 \le n \le 10^6)$表示城市和网络基站的数量。 每个测试数据的第二行包含$n$个正整数$a_i( 1 \le a_i \le 10^9)$表示第$i$个城市有多少个家庭需要网络。 每个测试数据的第三行包含$n$个正整数$b_i( 1 \le b_i \le 10^9)$表示第$i$个网络基站最多可以提供多少的网络。 保证测试数据中$n$的总和不超过$10^6$。 ### 输出格式 对于每一个测试数据，输出“YES”或者“NO”，表示能否使所有的家庭获得网络链接。

The government of Berland decided to improve network coverage in his country. Berland has a unique structure: the capital in the center and $ n $ cities in a circle around the capital. The capital already has a good network coverage (so the government ignores it), but the $ i $ -th city contains $ a_i $ households that require a connection. The government designed a plan to build $ n $ network stations between all pairs of neighboring cities which will maintain connections only for these cities. In other words, the $ i $ -th network station will provide service only for the $ i $ -th and the $ (i + 1) $ -th city (the $ n $ -th station is connected to the $ n $ -th and the $ 1 $ -st city). All network stations have capacities: the $ i $ -th station can provide the connection to at most $ b_i $ households. Now the government asks you to check can the designed stations meet the needs of all cities or not — that is, is it possible to assign each household a network station so that each network station $ i $ provides the connection to at most $ b_i $ households.

The first line contains a single integer $ t $ ( $ 1 \le t \le 10^4 $ ) — the number of test cases. The first line of each test case contains the single integer $ n $ ( $ 2 \le n \le 10^6 $ ) — the number of cities and stations. The second line of each test case contains $ n $ integers ( $ 1 \le a_i \le 10^9 $ ) — the number of households in the $ i $ -th city. The third line of each test case contains $ n $ integers ( $ 1 \le b_i \le 10^9 $ ) — the capacities of the designed stations. It's guaranteed that the sum of $ n $ over test cases doesn't exceed $ 10^6 $ .

For each test case, print YES, if the designed stations can meet the needs of all cities, or NO otherwise (case insensitive).

5
3
2 3 4
3 3 3
3
3 3 3
2 3 4
4
2 3 4 5
3 7 2 2
4
4 5 2 3
2 3 2 7
2
1 1
10 10

YES
YES
NO
YES
YES

In the first test case: - the first network station can provide $ 2 $ connections to the first city and $ 1 $ connection to the second city; - the second station can provide $ 2 $ connections to the second city and $ 1 $ connection to the third city; - the third station can provide $ 3 $ connections to the third city. In the second test case: - the $ 1 $ -st station can provide $ 2 $ connections to the $ 1 $ -st city; - the $ 2 $ -nd station can provide $ 3 $ connections to the $ 2 $ -nd city; - the $ 3 $ -rd station can provide $ 3 $ connections to the $ 3 $ -rd city and $ 1 $ connection to the $ 1 $ -st station. In the third test case, the fourth city needs $ 5 $ connections, but the third and the fourth station has $ 4 $ connections in total.