#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#define NMax 110
#define oo 0x3f3f3f3f
using namespace std;

const char IN[]="pm2.in",OUT[]="pm2.out";

int N,Rez;
int v[NMax] , gr[NMax] , T[NMax] , T2[NMax] , q[NMax];
vector<int> ad[NMax], F[NMax];
queue<int> qu;

int main()
{
	int i,j,x;
	freopen(IN,"r",stdin);
	scanf("%d",&N);
	for (i=1;i<=N;++i) scanf("%d",v+i);
	for (i=1;i<=N;++i)
	{
		scanf("%d",gr+i);
		if (!gr[i]) qu.push(i);
		for (j=0;j<gr[i];++j)
			scanf("%d",&x),
			ad[i].push_back(x),
			F[x].push_back(i);
	}
	fclose(stdin);

	while (!qu.empty())
	{
		x=qu.front();qu.pop();
		q[++q[0]]=x;
		for (i=0;i<(int)F[x].size();++i)
		{
			--gr[F[x][i]];
			T[F[x][i]]=max(T[F[x][i]],T[x]+v[x]);
			if (!gr[F[x][i]]) qu.push(F[x][i]);
		}
		Rez=max(Rez,T[x]+v[x]);
	}

	for (i=1;i<=N;++i) T2[i]=oo;
	for (i=N;i>0;--i)
	{
		if (T2[q[i]]==oo) T2[q[i]]=Rez-v[q[i]];
		for (j=0;j<(int)ad[q[i]].size();++j)
			T2[ad[q[i]][j]]=min(T2[ad[q[i]][j]],T2[q[i]]-v[ad[q[i]][j]]);
	}

	for (i=1;i<=N;++i) if (T2[i]==oo)
		T2[i]=Rez-v[i];

	freopen(OUT,"w",stdout);
	printf("%d\n",Rez);
	for (i=1;i<=N;++i) printf("%d %d\n",T[i],T2[i]);
	fclose(stdout);
	return 0;
}