小红的双生英雄

n, C, m = list(map(int, input().split()))
heromax = 4

baseinfo = []
for _ in range(n):
    baseinfo.append(list(map(int, input().split())))

pairsinfo = []
for _ in range(m):
    pairsinfo.append(list(map(int, input().split())))

pairsdict = dict()
for i in range(m):
    if pairsinfo[i][0] > pairsinfo[i][1]:
        pairsinfo[i][0], pairsinfo[i][1] = pairsinfo[i][1], pairsinfo[i][0]
    pairsdict[pairsinfo[i][0] - 1] = [pairsinfo[i][1] - 1, pairsinfo[i][2]]


def dpfind(info: list[list[int]]):
    dplist = [[0 for _ in range(C + 1)] for _ in range(heromax + 1)]
    for heroidx in range(n):
        for cmax in range(C, -1, -1):
            for heronum in range(heromax):
                herocost = info[heroidx][0]
                if herocost <= cmax:  # 如果这个英雄cost够低
                    newPower = info[heroidx][1] + dplist[heronum][cmax - herocost]
                    # print(dplist)
                    dplist[heronum + 1][cmax] = max(dplist[heronum + 1][cmax], newPower)
                    if heroidx in pairsdict.keys() and heronum < heromax - 1:
                        pairidx = pairsdict[heroidx][0]
                        paircost = info[pairidx][0]
                        if paircost + herocost <= cmax:
                            newPower = (
                                info[heroidx][1]
                                + info[pairidx][1]
                                + pairsdict[heroidx][1]
                                + dplist[heronum][cmax - herocost - paircost]
                            )
                            dplist[heronum + 2][cmax] = max(
                                dplist[heronum + 1][cmax], newPower
                            )

    return dplist[-1][-1]


print(dpfind(baseinfo))