/**
 *    author:  tourist
 *    created: 26.11.2019 11:07:03       
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, tt;
  cin >> n >> tt;
  n *= 2;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<int> b(n);
  for (int i = 0; i < n; i++) {
    cin >> b[i];
  }
  multiset<pair<int, int>> pos;
  multiset<pair<int, int>> neg;
  long long sum_pos = 0;
  long long sum_neg = 0;
  for (int i = 1; i < n - 1; i++) {
    if (a[i] > b[i]) {
      pos.emplace(a[i] - b[i], a[i]);
      sum_pos += a[i];
    } else {
      neg.emplace(b[i] - a[i], b[i]);
      sum_neg += b[i];
    }
  }
  while (tt--) {
    int i;
    cin >> i;
    --i;
    if (i > 0 && i < n - 1) {
      if (a[i] > b[i]) {
        pos.erase(pos.find({a[i] - b[i], a[i]}));
        sum_pos -= a[i];
      } else {
        neg.erase(neg.find({b[i] - a[i], b[i]}));
        sum_neg -= b[i];
      }
      cin >> a[i] >> b[i];
      if (a[i] > b[i]) {
        pos.emplace(a[i] - b[i], a[i]);
        sum_pos += a[i];
      } else {
        neg.emplace(b[i] - a[i], b[i]);
        sum_neg += b[i];
      }
    } else {
      cin >> a[i] >> b[i];
    }
    long long ans = a[0] + a[n - 1] + sum_pos + sum_neg;
    if (pos.size() % 2 == 1) {
      ans -= min(pos.begin()->first, neg.begin()->first);
    }
    cout << ans << '\n';
  }
  return 0;
}
