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>
int n;
double w[1111111], del[1111111];
struct pii {
  int t;
  double l;
};
std::vector<pii> v[1111111];
int siz[1111111];
bool vis[1111111];
void dfs(int p, int f = 0) {
  siz[p] = 1;
  for (auto t : v[p])
    if (t.t ^ f)
      if (!vis[t.t]) dfs(t.t, p), siz[p] += siz[t.t];
}
int getg(int p) {
  dfs(p);
  int rm = siz[p];
  for (;;) {
    for (auto t : v[p])
      if (!vis[t.t])
        if (siz[t.t] < siz[p])
          if (siz[t.t] * 2 > rm) {
            p = t.t;
            goto T;
          }
    break;
  T:;
  }
  return p;
}
double delta(int p, int f, double len) {
  double ret = 1.5 * w[p] * sqrt(len);
  for (auto t : v[p])
    if (t.t ^ f) ret += delta(t.t, p, len + t.l);
  return ret;
}
double calc(int p, int f = 0, double len = 0) {
  double ret = w[p] * len * sqrt(len);
  for (auto t : v[p])
    if (t.t ^ f) ret += calc(t.t, p, len + t.l);
  return ret;
}
double mxx = 1e100;
int asp;
void solve() {
  int s = 1;
  while (1) {
    s = getg(s), vis[s] = 1;
    double ans = calc(s);
    if (ans < mxx) mxx = ans, asp = s;
    if (siz[s] == 1) break;
    double ssd = 0;
    for (auto t : v[s])
      if (!vis[t.t]) ssd += (del[t.t] = delta(t.t, s, t.l));
    for (auto t : v[s])
      if (!vis[t.t])
        if (delta(t.t, s, t.l) * 2 >= ssd) {
          s = t.t;
          goto T;
        }
    break;
  T:;
  }
}
int main() {
  scanf("%d", &n);
  register int i;
  for (i = 1; i <= n; i++) scanf("%lf", w + i);
  for (i = 1; i < n; i++) {
    int x, y;
    double l;
    scanf("%d%d%lf", &x, &y, &l);
    v[x].push_back(pii{y, l}), v[y].push_back(pii{x, l});
  }
  solve(), printf("%d %.15lf\n", asp, mxx);
}
