#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
template <class S, class T>
istream& operator>>(istream& is, pair<S, T>& p) {
  return is >> p.first >> p.second;
}
template <class T>
istream& operator>>(istream& is, vector<T>& xs) {
  for (auto& x : xs) is >> x;
  return is;
}
template <class S, class T>
ostream& operator<<(ostream& os, const pair<S, T>& p) {
  return os << p.first << " " << p.second;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& xs) {
  for (unsigned int i = 0; i < xs.size(); ++i) os << (i ? " " : "") << xs[i];
  return os;
}
template <class T>
void maxi(T& x, T y) {
  if (x < y) x = y;
}
template <class T>
void mini(T& x, T y) {
  if (x > y) x = y;
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL MOD = 1e9 + 7;
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  LL N, Q;
  cin >> N >> Q;
  VL as(N * 2), bs(N * 2);
  cin >> as >> bs;
  int par = 0;
  LL sum = as[0] + as.back();
  multiset<LL> dels;
  for (int i = (1); i < (2 * N - 1); ++i) {
    LL mx = max(as[i], bs[i]);
    LL mn = min(as[i], bs[i]);
    sum += mx;
    if (mx == as[i]) par ^= 1;
    dels.insert(mn - mx);
  }
  while (Q--) {
    int p, x, y;
    cin >> p >> x >> y;
    --p;
    LL mx = max(as[p], bs[p]);
    LL mn = min(as[p], bs[p]);
    sum -= mx;
    if (mx == as[p]) par ^= 1;
    auto it = dels.find(mn - mx);
    dels.erase(it);
    as[p] = x;
    bs[p] = y;
    LL mx2 = max(as[p], bs[p]);
    LL mn2 = min(as[p], bs[p]);
    sum += mx2;
    if (mx2 == as[p]) par ^= 1;
    dels.insert(mn2 - mx2);
    LL ans = 0;
    if (par == 0) {
      ans = sum;
    } else {
      ans = sum + *(dels.rbegin());
    }
    cout << ans << endl;
  }
  return 0;
}
