#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

const ll INF = 1e18;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> w(3);
    for (int i = 0; i < 3; i++) {
        w[i].resize(i == 1 ? n : n - 1);
        for (int j = 0; j < int(w[i].size()); j++) {
            cin >> w[i][j];
        }
    }
    vector<ll> add(n, 0);
    for (; m--;) {
        int i, j, c;
        cin >> i >> j >> c;
        i--, j--;
        for (int k = i + 1; k <= j; k++) {
            add[k] += c;
        }
    }

    ll ans = INF, sum0 = 0, sum1 = accumulate(w[2].begin(), w[2].end(), 0LL);
    for (int i = 0; i < n; i++) {
        chmin(ans, sum0 + sum1 + w[1][i] + add[i]);
        if (i == n - 1) {
            break;
        }
        sum0 += w[0][i];
        sum1 -= w[2][i];
    }

    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    solve();
    return 0;
}