#include <bits/stdc++.h>
using namespace std;
long long N, Q, a[100009], b[100009];
long long solve() {
  vector<int> Z;
  long long sum = 0;
  for (int i = 1; i < 2 * N - 1; i++) {
    sum += a[i];
    Z.push_back(b[i] - a[i]);
  }
  sum += a[0] + a[2 * N - 1];
  sort(Z.begin(), Z.end(), greater<int>());
  long long maxn = 0, S = 0;
  for (int i = 0; i < Z.size(); i += 2) {
    S += Z[i] + Z[i + 1];
    maxn = max(maxn, S);
  }
  return sum + maxn;
}
int main() {
  cin >> N >> Q;
  for (int i = 0; i < 2 * N; i++) cin >> a[i];
  for (int i = 0; i < 2 * N; i++) cin >> b[i];
  for (int i = 0; i < Q; i++) {
    int p1, p2, p3;
    cin >> p1 >> p2 >> p3;
    p1--;
    a[p1] = p2;
    b[p1] = p3;
    cout << solve() << endl;
  }
  return 0;
}
