3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
struct P {
  int u, c;
};
int val[200005], is[200005], pt, len, mi;
vector<P> s[200005];
double sub;
void dfs1(int u, int fa, int add) {
  int i;
  if (add >= len) len = add, pt = u;
  for (i = 0; i < s[u].size(); i++) {
    int v = s[u][i].u;
    if (v == fa || is[v]) continue;
    dfs1(v, u, add + s[u][i].c);
  }
}
int dfs2(int u, int fa, int add) {
  int sum = 0, i;
  for (i = 0; i < s[u].size(); i++) {
    int v = s[u][i].u;
    if (v == fa || is[v]) continue;
    int tmp = dfs2(v, u, add + s[u][i].c);
    sum = max(sum, tmp + s[u][i].c);
  }
  if (add + sum > len) len = add + sum;
  if (add + sum == len) {
    if (abs(add - sum) < mi || mi == -1) {
      mi = abs(add - sum);
      pt = u;
    }
  }
  return sum;
}
double dfs3(int u, int fa, int add) {
  int i;
  sub += (double)sqrt(add) * val[u];
  double tmp = (double)sqrt(add) * add * val[u];
  for (i = 0; i < s[u].size(); i++) {
    int v = s[u][i].u;
    if (v == fa) continue;
    tmp += dfs3(v, u, add + s[u][i].c);
  }
  return tmp;
}
int main() {
  int n, i, j, x, y, z;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d", &val[i]);
  }
  for (i = 1; i < n; i++) {
    scanf("%d%d%d", &x, &y, &z);
    s[x].push_back((P){y, z});
    s[y].push_back((P){x, z});
  }
  int next = 1, out;
  double ans = 1e25;
  while (1) {
    len = 0, mi = -1;
    dfs1(next, -1, 0);
    dfs2(pt, -1, 0);
    is[pt] = 1;
    double ma = 0, tmp = 0;
    for (i = 0; i < s[pt].size(); i++) {
      int v = s[pt][i].u;
      sub = 0;
      tmp += dfs3(v, pt, s[pt][i].c);
      if (sub >= ma) {
        ma = sub, next = v;
      }
    }
    if (tmp < ans) {
      ans = tmp, out = pt;
    }
    if (is[next]) break;
  }
  printf("%d %.10f\n", out, ans);
}
