#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define endl "\n"
using namespace std;

const int N = 1e5 + 10;

int n, m;

int a[N], b[N];

int32_t main() {
  #define task ""

  cin.tie(0) -> sync_with_stdio(0);

  if (fopen("task.inp", "r")) {
    freopen("task.inp", "r", stdin);
    freopen("task.out", "w", stdout);
  }

  if (fopen(task".inp", "r")) {
    freopen (task".inp", "r", stdin);
    freopen (task".out", "w", stdout);
  }

  cin >> n >> m;

  for(int i = 1; i <= n; i++) cin >> a[i] >> b[i];

  auto get = [&] () {
    vector<int> pos, neg;
    long long ans = 0;
    for(int i = 1; i <= n; i++) {
      ans += a[i];
      if (b[i] - a[i] >= 0) pos.push_back(b[i] - a[i]);
      else neg.push_back(b[i] - a[i]);
    }
    sort(pos.begin(), pos.end(), greater<int> ());
    sort(neg.begin(), neg.end(), greater<int> ());
    for(int i = 1; i < pos.size(); i += 4) {
      ans += pos[i];
      if (i + 1 < pos.size()) ans += pos[i + 1];
    }
    for(int i = (int) pos.size() & 1 ^ 1; i < neg.size(); i += 2) {
      ans += neg[i];
    }
    return ans;
  };

  cout << get() << endl;

  while (m--) {
    int t, x, y; cin >> t >> x >> y;
    a[t] = x;
    b[t] = y;
    cout << get() << endl;
  }
}