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;
const int N = 200005;
int w[N];
int Head[N], Next[N << 1], Adj[N << 1], Weight[N << 1], tot = 0;
void addedge(int u, int v, int w) {
  Next[++tot] = Head[u], Head[u] = tot, Adj[tot] = v, Weight[tot] = w;
  Next[++tot] = Head[v], Head[v] = tot, Adj[tot] = u, Weight[tot] = w;
}
int S = 0, rt, mn;
bool vis[N];
void init() { S = 0, rt = 0, mn = 1 << 30; }
void getsz(int x, int f) {
  ++S;
  for (int e = Head[x]; e; e = Next[e])
    if (Adj[e] != f && (!vis[Adj[e]])) getsz(Adj[e], x);
}
int size[N];
void getrt(int x, int f) {
  size[x] = 1;
  int mx = 0;
  for (int e = Head[x]; e; e = Next[e])
    if (Adj[e] != f && (!vis[Adj[e]])) {
      getrt(Adj[e], x);
      size[x] += size[Adj[e]];
      mx = max(mx, size[Adj[e]]);
    }
  mx = max(mx, S - size[x]);
  if (mx < mn) mn = mx, rt = x;
}
double sd[N], sum, sumd;
void calc(int x, int r, int f, int dep) {
  sum += (double)sqrt(dep) * dep * w[x];
  sumd += 1.5 * sqrt((double)dep) * w[x];
  sd[r] += 1.5 * w[x] * sqrt((double)dep);
  for (int e = Head[x]; e; e = Next[e])
    if (Adj[e] != f) calc(Adj[e], r, x, dep + Weight[e]);
}
int ans1;
double ans2 = 1e30;
void solve(int x) {
  vis[x] = true;
  sum = sumd = 0;
  for (int e = Head[x]; e; e = Next[e])
    sd[Adj[e]] = 0, calc(Adj[e], Adj[e], x, Weight[e]);
  if (sum < ans2) ans2 = sum, ans1 = x;
  for (int e = Head[x]; e; e = Next[e])
    if ((!vis[Adj[e]]) && (sumd - 2 * sd[Adj[e]] < 0)) {
      init();
      getsz(Adj[e], x);
      getrt(Adj[e], x);
      solve(rt);
    }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1; i < n; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    addedge(x, y, z);
  }
  init();
  S = n;
  getrt(1, 0);
  solve(rt);
  printf("%d %.9f", ans1, ans2);
  return 0;
}
