#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

int main(){
    ll H, W, sx, sy, N;
    cin >> H >> W >> sx >> sy >> N;
    sx--;
    sy--;

    vector<ll> x(N + 1);
    vector<ll> y(N + 1);
    vector<ll> c(N + 1);
    x[0] = sx;
    y[0] = sy;
    c[0] = 0;
    for (ll i = 1; i <= N; i++){
        cin >> x[i] >> y[i] >> c[i];
        x[i]--;
        y[i]--;
    }

    ll INF = 100000000023LL;

    vector<ll> dp(N + 1, -INF);
    
    dp[0] = 0;
    for (ll i = 1; i <= N; i++){
        for (ll j = 1; j <= 2; j++){
            if (i - j < 0) continue;
            if (j == 1){
                if (x[i] == x[i - j] || y[i] == y[i - j] || x[i] + y[i] == x[i - j] + y[i - j] || x[i] - y[i] == x[i - j] - y[i - j]){
                    dp[i] = max(dp[i], dp[i - j] + c[i]);
                }
            }
            else{
                dp[i] = max(dp[i], dp[i - j] + c[i]);
            }
        }
    }
    ll ans = -INF;
    for (ll i = 0; i <= N; i++){
        ans = max(ans, dp[i]);
    }
    cout << ans << endl;
}