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;
template <typename tn>
void read(tn &a) {
  tn x = 0, f = 1;
  char c = ' ';
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
  a = x * f;
}
const int N = 201000;
struct edge {
  int v, w;
};
vector<edge> e[N];
int w[N], W, n, s[N], mx[N], siz, rt, h[N];
long double g[N], ans;
void getroot(int x, int dad) {
  s[x] = 1;
  mx[x] = 0;
  for (auto v : e[x])
    if (v.v != dad && !h[v.v]) {
      getroot(v.v, x);
      s[x] += s[v.v];
      mx[x] = max(mx[x], s[v.v]);
    }
  mx[x] = max(mx[x], siz - s[x]);
  if (!rt || mx[x] < mx[rt]) rt = x;
}
void calc_f(int x, int dad, long double &F, int dis = 0) {
  F += dis * sqrtl(dis) * w[x];
  for (auto v : e[x])
    if (v.v != dad) calc_f(v.v, x, F, dis + v.w);
}
void calc_g(int x, int dad, int dis = 0) {
  g[x] = sqrtl(dis) * 1.5 * w[x];
  for (auto v : e[x])
    if (v.v != dad) {
      calc_g(v.v, x, dis + v.w);
      g[x] += g[v.v];
    }
}
void solve(int x) {
  h[x] = 1;
  getroot(x, 0);
  long double F = 0;
  calc_f(x, 0, F);
  calc_g(x, 0);
  if (F < ans) ans = F, W = x;
  for (auto v : e[x])
    if (!h[v.v] && g[x] - g[v.v] < g[v.v]) {
      siz = s[v.v];
      rt = 0;
      getroot(v.v, 0);
      solve(rt);
      return;
    }
}
int main() {
  read(n);
  for (int i = 1; i <= n; i++) read(w[i]);
  for (int i = 1; i < n; i++) {
    int x, y, z;
    read(x);
    read(y);
    read(z);
    e[x].push_back({y, z});
    e[y].push_back({x, z});
  }
  siz = n;
  ans = 1e24l;
  getroot(1, 0);
  solve(rt);
  printf("%d %.10Lf\n", W, ans);
  return 0;
}
