#define db(...) fprintf(stderr, __VA_ARGS__)
#include "fish.h"
#include <cstdio>
#include <vector>
#include <algorithm>
#include <vector>
#include <queue>
#define X first
#define Y second
#define PB push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 10;
const ll OO = 1e18;
int n, m;
ll a[N];
ll dp[N];
ll max_weights(int nn, int mm, vector<int> xx, vector<int> yy, vector<int> ww) {
n = nn;
m = mm;
for(int i = 0; i < m; ++i) {
a[xx[i]] += ww[i];
}
for(int i = n - 1; i >= 0; --i) {
dp[i] = max(dp[i + 2] + a[i + 1], dp[i + 3] + a[i + 1] + a[i + 2]);
}
return max(dp[0], n > 1 ? a[0] + dp[1] : 0);
}
