#include <iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int main()
{
int K, T,t[2001],dt[2001],dp[2001];
cin >> T;
while(T--){
cin >> K;
for(int i = 1; i <= K; i++) cin >> t[i];
for(int i = 1; i <= K -1; i++) cin >> dt[i];
dp[0] = 0;
for(int i = 1; i <= K; i++){
dp[i] = dp[i - 1] + t[i];
if(i - 2 >=0){
dp[i] = min(dp[i],dp[i-2] + dt[i - 1]);
}
}
//cout << dp[K] << endl;
int a,b,c;
c = dp[K] %60;
b = (dp[K] /60) %60;
a = dp[K] / 3600;
if((a+8 == 12 && (b || c)) ) printf("%02d:%02d:%02d pm\n",a+8,b,c);
else if(a+8 > 12) printf("%02d:%02d:%02d pm\n",a - 4,b,c);
else printf("%02d:%02d:%02d am\n",a+8,b,c);
}
return 0;
}