```python
def cal_sum(n):
    """
    Calculates the sum of the first n Perrin numbers.

    The Perrin sequence is defined by the recurrence relation:
    P(n) = P(n-2) + P(n-3)
    with initial values P(0) = 3, P(1) = 0, P(2) = 2.

    Args:
        n: The number of Perrin numbers to sum (a non-negative integer).

    Returns:
        The sum of the first n Perrin numbers.
    """
    if n <= 0:
        return 0

    perrin_numbers = [3, 0, 2]

    while len(perrin_numbers) < n:
        next_number = perrin_numbers[-3] + perrin_numbers[-2]
        perrin_numbers.append(next_number)

    # Sum the first n numbers, slicing the list in case n < 3.
    return sum(perrin_numbers[:n])

```