Problem: Some country consists of n cities, connected by a railroad network. The transport communication of the country is so advanced that the network consists of a minimum required number of (n - 1) bidirectional roads (in the other words, the graph of roads is a tree). The i-th road that directly connects cities ai and bi, has the length of li kilometers.

The transport network is served by a state transporting company FRR (Fabulous Rail Roads). In order to simplify the price policy, it offers a single ride fare on the train. In order to follow the route of length t kilometers, you need to pay <image> burles. Note that it is forbidden to split a long route into short segments and pay them separately (a special railroad police, or RRP, controls that the law doesn't get violated).

A Large Software Company decided to organize a programming tournament. Having conducted several online rounds, the company employees determined a list of finalists and sent it to the logistical department to find a place where to conduct finals. The Large Software Company can easily organize the tournament finals in any of the n cities of the country, so the the main factor in choosing the city for the last stage of the tournament is the total cost of buying tickets for all the finalists. We know that the i-th city of the country has wi cup finalists living there.

Help the company employees find the city such that the total cost of travel of all the participants to it is minimum.

Input

The first line of the input contains number n (1 ≤ n ≤ 200 000) — the number of cities in the country.

The next line contains n integers w1, w2, ..., wn (0 ≤ wi ≤ 108) — the number of finalists living in each city of the country.

Next (n - 1) lines contain the descriptions of the railroad, the i-th line contains three integers, ai, bi, li (1 ≤ ai, bi ≤ n, ai ≠ bi, 1 ≤ li ≤ 1000).

Output

Print two numbers — an integer f that is the number of the optimal city to conduct the competition, and the real number c, equal to the minimum total cost of transporting all the finalists to the competition. Your answer will be considered correct if two conditions are fulfilled at the same time: 

  1. The absolute or relative error of the printed number c in comparison with the cost of setting up a final in city f doesn't exceed 10 - 6; 
  2. Absolute or relative error of the printed number c in comparison to the answer of the jury doesn't exceed 10 - 6. 



If there are multiple answers, you are allowed to print any of them.

Examples

Input

5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1


Output

3 192.0

Input

2
5 5
1 2 2


Output

1 14.142135623730951000

Note

In the sample test an optimal variant of choosing a city to conduct the finals of the competition is 3. At such choice the cost of conducting is <image> burles.

In the second sample test, whatever city you would choose, you will need to pay for the transport for five participants, so you will need to pay <image> burles for each one of them.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T &Read(T &first) {
  static char c;
  while (!isdigit(c = getchar()))
    ;
  first = c - '0';
  while (isdigit(c = getchar())) (first *= 10) += c - '0';
  return first;
}
const int maxn = 200000;
struct edge {
  int id, g, nxt;
  edge() {}
  edge(const int &_id, const int &_g, const int &_nxt)
      : id(_id), g(_g), nxt(_nxt) {}
};
edge e[(maxn << 1) + 5];
int en = 0;
int st[maxn + 5];
inline void add_edge(const int &first, const int &second, const int &z) {
  e[en] = edge(second, z, st[first]), st[first] = en++;
}
inline void del_edge(const int &first, const int &second) {
  for (int *i = st + first; *i != -1; i = &e[*i].nxt)
    if (e[*i].id == second) {
      *i = e[*i].nxt;
      break;
    }
}
int n;
int w[maxn + 5];
int ans;
double ansval;
int sz[maxn + 5];
int Max[maxn + 5];
int all[maxn + 5], alln = 0;
bool vis[maxn + 5];
void pre_dfs(const int &first, const int &f = -1) {
  all[alln++] = first;
  sz[first] = 1;
  Max[first] = 0;
  for (int i = st[first]; i != -1; i = e[i].nxt) {
    const int &second = e[i].id;
    if (second == f) continue;
    if (vis[second]) continue;
    pre_dfs(second, first);
    sz[first] += sz[second];
    Max[first] = max(Max[first], sz[second]);
  }
}
double sum = 0;
int dep[maxn + 5];
int rt;
void dfs(const int &first, const int &f = -1) {
  sum += (double)w[first] * sqrt((double)dep[first]);
  for (int i = st[first]; i != -1; i = e[i].nxt) {
    const int &second = e[i].id;
    if (second == f) continue;
    dep[second] = dep[first] + e[i].g;
    dfs(second, first);
  }
}
void calc(const int &first, const int &f = -1, const int &dep = 0) {
  sum += (double)w[first] * dep * sqrt((double)dep);
  for (int i = st[first]; i != -1; i = e[i].nxt) {
    const int &second = e[i].id;
    if (second == f) continue;
    calc(second, first, dep + e[i].g);
  }
}
void update(const int &first) {
  sum = 0;
  calc(first);
  if (ans == -1 || sum < ansval) ans = first, ansval = sum;
}
void work(const int &rt) {
  ::rt = rt;
  alln = 0;
  pre_dfs(rt);
  int first = -1;
  for (int i = (0), _end_ = (alln); i < _end_; ++i) {
    const int &second = all[i];
    Max[second] = max(Max[second], alln - sz[second]);
    if (first == -1 || Max[second] < Max[first]) first = second;
  }
  update(first);
  if (alln == 1) return;
  int Max = -1;
  double Maxval;
  for (int i = st[first]; i != -1; i = e[i].nxt) {
    const int &second = e[i].id;
    if (vis[second]) continue;
    dep[second] = e[i].g;
    sum = 0;
    dfs(second, first);
    if (Max == -1 || sum > Maxval) Max = second, Maxval = sum;
  }
  vis[first] = 1;
  work(Max);
}
int main() {
  int n;
  scanf("%d", &n);
  memset(st, -1, sizeof st), en = 0;
  for (int i = (0), _end_ = (n); i < _end_; ++i) scanf("%d", w + i);
  for (int i = (0), _end_ = (n - 1); i < _end_; ++i) {
    static int first, second, z;
    scanf("%d%d%d", &first, &second, &z), --first, --second;
    add_edge(first, second, z), add_edge(second, first, z);
  }
  ans = -1;
  work(0);
  printf("%d ", ans + 1);
  printf("%.16f\n", ansval);
  return 0;
}