#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;


void solve(void)
{
    int n;
    cin >> n;
    vi a(n + 2);
    for (int i = 1; i < n; i++)
        cin >> a[i];
    vl pre(n + 2);
    for (int i = 1; i < n; i++)
        pre[i] = pre[i - 1] + a[i];
    ll ans = 0, sum = 0;
    int u = 1;
    while (u <= n / 2)
    {
        ans += sum;
        cout << ans << " ";
        sum += pre[n - u] - pre[u - 1];
        ans += sum;
        cout << ans << " ";
        u++;
    }
    if (n & 1)
        cout << ans + sum << " ";
    cout << "\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int T = 1;
    cin >> T;
    for (int i = 1; i <= T; i++)
        solve();

    return 0;
}