#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, int>;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, q;
  cin >> n >> q;
  int m = 2 * n;
  vector<ll> a(m), b(m);
  for (int i = 0; i < m; i++) cin >> a[i];
  for (int i = 0; i < m; i++) cin >> b[i];
  vector<int> p(q);
  vector<ll> x(q), y(q);
  for (int i = 0; i < q; i++) {
    cin >> p[i] >> x[i] >> y[i];
    p[i]--;
  }
  ll base = 0;
  ll sum = 0;
  set<P> s;
  for (int i = 0; i < m; i++) {
    base += a[i];
    if (i > 0 && i < m - 1 && a[i] <= b[i]) {
      sum += b[i] - a[i];
      s.emplace(b[i] - a[i], i);
    }
  }
  for (int i = 0; i < q; i++) {
    base += x[i] - a[p[i]];
    if (p[i] == 0 || p[i] == m - 1) {
      if (s.size() % 2 == 1) {
        cout << base + sum - s.begin()->first << endl;
      } else {
        cout << base + sum << endl;
      }
    } else {
      if (b[p[i]] >= a[p[i]]) {
        s.erase(P(b[p[i]] - a[p[i]], p[i]));
        sum -= b[p[i]] - a[p[i]];
      }
      if (y[i] >= x[i]) {
        s.emplace(y[i] - x[i], p[i]);
        sum += y[i] - x[i];
      }
      if (s.size() % 2 == 1) {
        cout << base + sum - s.begin()->first << endl;
      } else {
        cout << base + sum << endl;
      }
    }
    a[p[i]] = x[i];
    b[p[i]] = y[i];
  }
  return 0;
}
