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>
const int MAXN = 2e5 + 5;
struct Edge {
  int to, w, nxt;
} e[MAXN << 1];
int head[MAXN], cnt;
inline void add(int u, int v, int w) {
  e[++cnt] = (Edge){v, w, head[u]};
  head[u] = cnt;
  e[++cnt] = (Edge){u, w, head[v]};
  head[v] = cnt;
}
int mx[MAXN], sz[MAXN], rt;
bool vis[MAXN];
inline void getroot(int v, int fa = 0) {
  mx[v] = 0;
  sz[v] = 1;
  for (int i = head[v]; i; i = e[i].nxt) {
    if (e[i].to == fa || vis[e[i].to]) continue;
    getroot(e[i].to, v);
    sz[v] += sz[e[i].to];
    mx[v] = std::max(mx[v], sz[e[i].to]);
  }
  mx[v] = std::max(mx[v], mx[0] - sz[v]);
  if (mx[rt] > mx[v]) rt = v;
}
double sd[MAXN], smd;
int d[MAXN], now;
inline void getdep(int v, int dep, int fa = 0) {
  double d = 1.0 * ::d[v] * std::sqrt(1.0 * dep) * 3.0 / 2.0;
  sd[now] += d;
  smd += d;
  for (int i = head[v]; i; i = e[i].nxt) {
    if (e[i].to == fa || vis[e[i].to]) continue;
    getdep(e[i].to, dep + e[i].w, v);
  }
}
int t1 = -1, t2 = -1;
inline void work(int v) {
  vis[v] = 1;
  smd = 0;
  for (int i = head[v]; i; i = e[i].nxt) {
    if (vis[e[i].to]) continue;
    now = e[i].to;
    getdep(e[i].to, e[i].w, v);
  }
  for (int i = head[v]; i; i = e[i].nxt) {
    if (vis[e[i].to]) continue;
    if (smd - sd[e[i].to] - sd[e[i].to] < 0) {
      mx[rt = 0] = sz[e[i].to];
      getroot(e[i].to);
      t1 = v;
      t2 = e[i].to;
      work(rt);
      return;
    }
  }
}
inline double getans(int v, int dep = 0, int fa = 0) {
  double res = 1.0 * dep * sqrt(1.0 * dep) * d[v];
  for (int i = head[v]; i; i = e[i].nxt) {
    if (e[i].to == fa) continue;
    res += getans(e[i].to, dep + e[i].w, v);
  }
  return res;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", d + i);
  for (int i = 2; i <= n; ++i) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    add(u, v, w);
  }
  mx[rt = 0] = n;
  getroot(1);
  t1 = rt;
  work(rt);
  if (t2 == -1) {
    printf("%d %.10lf\n", t1, getans(t1));
    return 0;
  }
  double ans1 = getans(t1), ans2 = getans(t2);
  if (ans1 < ans2)
    printf("%d %.10lf\n", t1, ans1);
  else
    printf("%d %.10lf\n", t2, ans2);
  return 0;
}
