#line 2 "/home/cocojapanpan/Procon_CPP/proconLibrary/lib/template/procon.hpp"

#ifndef DEBUG
// 提出時にassertはオフ
#ifndef NDEBUG
#define NDEBUG
#endif
// 定数倍高速化
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(x) (x).begin(), (x).end()
template <class T>
using vec = vector<T>;
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T>
constexpr T INF = 1'000'000'000;
template <>
constexpr int INF<int> = 1'000'000'000;
template <>
constexpr ll INF<ll> = ll(INF<int>) * INF<int> * 2;
#line 2 "main.cpp"

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, M;
    cin >> N >> M;
    vec<ll> A(M);
    for(ll &a : A) cin >> a;
    int Q;
    cin >> Q;
    ll ans = 0;
    for(int i = 0; i < M; i++) {
        ans += A[i] * A[i];
    }
    for(int i = 0; i < Q; i++) {
        int C, K, D;
        cin >> C >> K >> D;
        --C; --D;
        ans -= (A[C] * A[C] - (A[C] - K) * (A[C] - K));
        ans += (A[D] + K) * (A[D] + K) - A[D] * A[D];
        A[D] += K;
        A[C] -= K;
        cout << ans << "\n";
    }
}