#include <bits/stdc++.h>
using namespace std;
int N, Q;
int A[101010];
int B[101010];
multiset<int> p, n;
void solve() {
  int i, j, k, l, r, x, y;
  string s;
  cin >> N >> Q;
  signed long long S = 0, T = 0;
  for (i = 0; i < (2 * N); i++) cin >> A[i], S += A[i];
  for (i = 0; i < (2 * N); i++) {
    cin >> B[i];
    B[i] -= A[i];
    if (i != 0 && i != 2 * N - 1) {
      if (B[i] > 0) {
        p.insert(B[i]);
        T += B[i];
      } else {
        n.insert(-B[i]);
      }
    }
  }
  while (Q--) {
    cin >> i >> x >> y;
    i--;
    S -= A[i];
    if (B[i] > 0) {
      p.erase(p.find(B[i]));
      T -= B[i];
    } else {
      n.erase(n.find(-B[i]));
    }
    A[i] = x;
    S += x;
    B[i] = y - A[i];
    if (i != 0 && i != 2 * N - 1) {
      if (B[i] > 0) {
        p.insert(B[i]);
        T += B[i];
      } else {
        n.insert(-B[i]);
      }
    }
    signed long long ma = 0;
    if (p.size() % 2 == 0)
      ma = S + T;
    else
      ma = S + max(T - *p.begin(), T - *n.begin());
    cout << ma << endl;
  }
}
int main(int argc, char** argv) {
  string s;
  int i;
  if (argc == 1) ios::sync_with_stdio(false), cin.tie(0);
  for (i = 0; i < (argc - 1); i++) s += argv[i + 1], s += '\n';
  for (i = 0; i < (s.size()); i++) ungetc(s[s.size() - 1 - i], stdin);
  cout.tie(0);
  solve();
  return 0;
}
