#include<iostream>

 #include<cstdio>

 using namespace std;

 const int MAXN=+;

 const int INF=;

 int map[MAXN][MAXN];

 int main()

 {

     int n;

     while (scanf("%d",&n))

     {

         if (n==) break;

         for (int i=;i<n;i++)

             for (int j=;j<n;j++) map[i][j]=INF;

         for (int i=;i<n;i++)

         {

             int m;

             scanf("%d",&m);

             for (int j=;j<m;j++)

             {

                 int people,time;

                 scanf("%d%d",&people,&time);

                 map[i][people-]=time;

             }

         }

         for (int k=;k<n;k++)

             for (int i=;i<n;i++)

                 for (int j=;j<n;j++)

                         if (i!=j && k!=i && k!=j && map[i][j]>map[i][k]+map[k][j])

                             {

                                 map[i][j]=map[i][k]+map[k][j];

                             }

         int ans=INF,ansb;

         for (int i=;i<n;i++)

         {

             bool reach=true;

             int maxlen=-;

             for (int j=;j<n && reach;j++)

             {

                 if (i!=j && map[i][j]==INF) reach=false;

                 if (i!=j && map[i][j]>maxlen) maxlen=map[i][j];

             }

             if (reach && maxlen<ans)

             {

                 ans=maxlen;

                 ansb=i;

             }

         }

         if (ans==INF) cout<<"disjoint";else cout<<ansb+<<' '<<ans;

         cout<<endl;

     }

     return ;

 }