#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
using i64 = long long;

const i64 INF = 1e5 + 5;

struct SegTree {
#define ls (p << 1)
#define rs ((p << 1) | 1)
#define mid ((l + r) >> 1)

    int n, cnt;
    vector<i64> siz;
    vector<vector<i64> > val;

    SegTree(int N = (INF << 1)) : n(N) {
        siz.resize(n << 2);
        val = vector(n << 2, vector<i64>(4));
    }

    void update(int p) {
        siz[p] = siz[ls] + siz[rs];
        for (int i = 0; i < 4; i++) {
            val[p][i] = val[ls][i];
            val[p][(i + siz[ls]) % 4] += val[rs][i];
        }
    }

    void add(i64 x, int k, int p = 1, i64 l = -INF, i64 r = INF) {
        if (l == r) {
            if (k == 1)
                val[p][siz[p] % 4] += x;
            else
                val[p][(siz[p] - 1) % 4] -= x;
            siz[p] += k;
            return;
        }

        if (x <= mid)
            add(x, k, ls, l, mid);
        else
            add(x, k, rs, mid + 1, r);
        update(p);
    }

    i64 query(int p = 1) {
        i64 resl = val[ls][0] + val[ls][3], resr = 0;
        if (siz[ls] * 2 % 4 == 0)
            resr = val[rs][0] + val[rs][2];
        else
            resr = val[rs][1] + val[rs][3];
        return resl + resr;
    }
};

void solve() {
    int n, m;
    cin >> n >> m;
    SegTree tr;

    i64 sumb = 0;
    vector<i64> a(n + 1), b(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
        sumb += b[i];
        tr.add(a[i] - b[i], 1);
    }
    cout << tr.query() + sumb << endl;

    while (m--) {
        int x, aa, bb;
        cin >> x >> aa >> bb;

        sumb -= b[x];
        tr.add(a[x] - b[x], -1);

        a[x] = aa;
        b[x] = bb;

        sumb += b[x];
        tr.add(a[x] - b[x], 1);

        cout << tr.query() + sumb << endl;
    }

    // cout << "YES\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();
    return 0;
}