{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"最多10000个点,从1开始编号\n一个城市到另一个城市的路线唯一(是一颗树)"}},{"title":"Input","value":{"format":"HTML","content":"有很多行,每行一条边,x、y、len,代表有一条长度为len的边连x到y的城市"}},{"title":"Output","value":{"format":"HTML","content":"输出最远两个城市之间的距离"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e5 1 6\n1 4 5\n6 3 9\n2 6 8\n6 1 7\n\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e22\u003c/pre\u003e"}}]}