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 edge {
  int to, nxt, w;
} e[200005 << 1];
int n, cnt, Sz, Rt, Mn, ans1;
int val[200005], fir[200005], sz[200005];
bool vis[200005];
double ans2, sum, sumh;
double h[200005];
void add(int, int, int);
void get_rt(int, int);
void get_sz(int, int);
void divide(int);
void calc(int, int, int, int);
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", val + i);
  for (int i = 2; i <= n; ++i) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    add(u, v, w);
    add(v, u, w);
  }
  ans2 = 9000000000000000000;
  Sz = n;
  Mn = n + 1;
  get_sz(1, 0);
  get_rt(1, 0);
  divide(Rt);
  printf("%d %.10lf\n", ans1, ans2);
  return 0;
}
void add(int u, int v, int w) {
  e[++cnt] = (edge){v, fir[u], w};
  fir[u] = cnt;
  return;
}
void get_sz(int u, int fa) {
  sz[u] = 1;
  for (int i = fir[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == fa || vis[v]) continue;
    get_sz(v, u);
    sz[u] += sz[v];
  }
  return;
}
void get_rt(int u, int fa) {
  int mx = 0;
  for (int i = fir[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == fa || vis[v]) continue;
    mx = max(mx, sz[v]);
    get_rt(v, u);
  }
  mx = max(mx, Sz - sz[u]);
  if (mx < Mn) Mn = mx, Rt = u;
  return;
}
void calc(int u, int fa, int rt, int dis) {
  sum += pow(dis, 1.5) * val[u];
  double tmp = 1.5 * val[u] * sqrt(dis);
  sumh += tmp;
  h[rt] += tmp;
  for (int i = fir[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == fa) continue;
    calc(v, u, rt, dis + e[i].w);
  }
  return;
}
void divide(int u) {
  if (vis[u]) return;
  sum = sumh = 0;
  vis[u] = true;
  for (int i = fir[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    h[v] = 0;
    calc(v, u, v, e[i].w);
  }
  if (sum < ans2) ans1 = u, ans2 = sum;
  for (int i = fir[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (sumh - h[v] * 2 < 0) {
      Mn = n + 1;
      get_sz(v, u);
      Sz = sz[v];
      get_rt(v, u);
      divide(Rt);
      break;
    }
  }
  return;
}
