1 #include <stdio.h>
 2 #define INF 0x3f3f3f3f
 3 
 4 int n;
 5 int Map[110][110];
 6 
 7 void Floyd()
 8 {
 9     for(int k = 1; k <= n; k++)
10     {
11         for(int i = 1; i <= n; i++)
12         {
13             for(int j = 1; j <= n; j++)
14             {
15                 if(i != j && Map[i][j] > Map[i][k]+Map[k][j])
16                 {
17                     Map[i][j] = Map[i][k]+Map[k][j];
18                 }
19             }
20         }
21     }
22     int t;
23     int Min_length = INF;
24     for(int i = 1; i <= n; i++)
25     {
26         int Max_length = 0;
27         for(int j = 1; j <= n; j++)
28         {
29             if(i != j && Max_length < Map[i][j])
30             {
31                 Max_length = Map[i][j];
32             }
33         }
34         if(Min_length > Max_length)
35         {
36             Min_length = Max_length;
37             t = i;
38         }
39     }
40     if(Min_length < INF)
41     {
42         printf("%d %d\n", t, Min_length);
43     }
44     else
45     {
46         printf("disjoint\n");
47     }
48     return ;
49 }
50 
51 void Solve()
52 {
53     int a, b;
54     int m;
55     while(~scanf("%d", &n) && n)
56     {
57         for(int i = 0; i <= n; i++)
58         {
59             for(int j = 0; j <= n; j++)
60             {
61                 Map[i][j] = INF;
62             }
63         }
64         for(int i = 1; i <= n; i++)
65         {
66             scanf("%d", &m);
67             for(int j = 1; j <= m; j++)
68             {
69                 scanf("%d%d", &a, &b);
70                 Map[i][a] = b;
71             }
72         }
73         Floyd();
74     }
75 }
76 
77 int main()
78 {
79     Solve();
80 
81     return 0;
82 }