#include <stdio.h>
#define REP(i,j,k) for(i=j;i<k;i++)

int main()
{
	int i,j,k,max,n,m,t=0;
	int chores[10005];
	scanf("%d",&n);
	REP(i,0,n)
	{
		scanf("%d",&chores[i]);
		scanf("%d",&m);
		max = 0;
		REP(j,0,m)
		{
			scanf("%d",&k);
			max =(chores[k-1]>max)?chores[k-1]:max;
		}
		chores[i] += max;
		t = (chores[i]>t)?chores[i]:t;
	}
	printf("%d\n",t);
	return 0;
}