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;
void SR(int &x) { scanf("%d", &x); }
void SR(long long &x) { scanf("%lld", &x); }
void SR(double &x) { scanf("%lf", &x); }
void SR(char *s) { scanf("%s", s); }
void RI() {}
template <typename I, typename... T>
void RI(I &x, T &...tail) {
  SR(x);
  RI(tail...);
}
const int maxn = 2e5 + 5;
int n;
struct Edge {
  Edge() {}
  Edge(int t, int w) : tar(t), wei(w) {}
  int tar, wei;
};
vector<Edge> edge[maxn];
int w[maxn];
void read() {
  RI(n);
  for (int i = (1); i <= int(n); i++) RI(w[i]);
  for (int i = 0; i < int(n - 1); i++) {
    int a, b, c;
    RI(a, b, c);
    edge[a].push_back(Edge(b, c));
    edge[b].push_back(Edge(a, c));
  }
}
void build() {}
bitset<maxn> del;
int siz[maxn], par[maxn];
int dfs1(int u, int p, vector<int> &node) {
  siz[u] = 1;
  par[u] = p;
  node.push_back(u);
  for (auto v : edge[u])
    if (!del[v.tar] && v.tar != p) siz[u] += dfs1(v.tar, u, node);
  return siz[u];
}
int dis[maxn];
void dfs2(int u, int p, int d) {
  dis[u] = d;
  par[u] = p;
  for (auto v : edge[u])
    if (v.tar != p) dfs2(v.tar, u, d + v.wei);
}
double dfs3(int u) {
  double ans = sqrt(dis[u]) * w[u];
  for (auto v : edge[u])
    if (v.tar != par[u]) ans += dfs3(v.tar);
  return ans;
}
double calc(int u, int p, int d) {
  double ans = d * sqrt(d) * w[u];
  for (auto v : edge[u])
    if (v.tar != p) ans += calc(v.tar, u, d + v.wei);
  return ans;
}
void sol() {
  int cur = 1;
  while (1) {
    vector<int> node;
    dfs1(cur, 0, node);
    if (((int)(node).size()) == 1) {
      cur = node[0];
      break;
    }
    int cent = cur, lo = 1 << 30;
    for (auto u : node) {
      int mysiz = siz[cur] - siz[u];
      for (auto v : edge[u])
        if (!del[v.tar] && v.tar != par[u]) mysiz = max(mysiz, siz[v.tar]);
      if (mysiz < lo) cent = u, lo = mysiz;
    }
    dfs2(cent, 0, 0);
    vector<pair<int, double> > der;
    for (auto v : edge[cent]) der.push_back(make_pair(v.tar, dfs3(v.tar)));
    double tot = 0;
    for (auto p : der) tot += p.second;
    int best = cent;
    double mi = 0;
    for (auto p : der)
      if (tot - 2 * p.second < mi) mi = tot - 2 * p.second, best = p.first;
    if (best == cent || calc(best, 0, 0) >= calc(cent, 0, 0)) {
      cur = cent;
      break;
    }
    cur = best;
    del[cent] = 1;
  }
  printf("%d %.16lf\n", cur, calc(cur, 0, 0));
}
int main() {
  read();
  build();
  sol();
  return 0;
}
