#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

void solve() {
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vector<int> vec(n);
        for (int i = 0; i < n; ++i) {
            cin >> vec[i];
        }
        int ans = 0;
        int maxele = 0;
        for (int i = 0; i < n; ++i) {
            if (vec[i] == 0 || i == n - 1) {
                ans += maxele;
                maxele = 0;
            } else {
                maxele = max(maxele, vec[i]);
            }
        }
        cout << ans << endl;
    }
}

int main() {
    solve();
    return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdm9pZCBzb2x2ZSgpIHsKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSB7CiAgICAgICAgaW50IG47CiAgICAgICAgY2luID4+IG47CiAgICAgICAgdmVjdG9yPGludD4gdmVjKG4pOwogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgKytpKSB7CiAgICAgICAgICAgIGNpbiA+PiB2ZWNbaV07CiAgICAgICAgfQogICAgICAgIGludCBhbnMgPSAwOwogICAgICAgIGludCBtYXhlbGUgPSAwOwogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgKytpKSB7CiAgICAgICAgICAgIGlmICh2ZWNbaV0gPT0gMCB8fCBpID09IG4gLSAxKSB7CiAgICAgICAgICAgICAgICBhbnMgKz0gbWF4ZWxlOwogICAgICAgICAgICAgICAgbWF4ZWxlID0gMDsKICAgICAgICAgICAgfSBlbHNlIHsKICAgICAgICAgICAgICAgIG1heGVsZSA9IG1heChtYXhlbGUsIHZlY1tpXSk7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICAgICAgY291dCA8PCBhbnMgPDwgZW5kbDsKICAgIH0KfQoKaW50IG1haW4oKSB7CiAgICBzb2x2ZSgpOwogICAgcmV0dXJuIDA7Cn0K

CjQKNAoxIDIgMiAxCjUKMSAwIDEgMCAxCjUKNSA0IDMgMiAxCjEKMTIK

4
4
1 2 2 1
5
1 0 1 0 1
5
5 4 3 2 1
1
12